scholarly journals Fully Dynamically Maintaining Minimal Integral Separator for Threshold and Difference Graphs

2016 ◽  
pp. 313-324
Author(s):  
Tiziana Calamoneri ◽  
Angelo Monti ◽  
Rossella Petreschi
Keyword(s):  
Difference Graphs

scholarly journals Difference graphs

1990 ◽  
Vol 28 (1) ◽  
pp. 35-44 ◽  
Author(s):  
Peter L. Hammer ◽  
Uri N. Peled ◽  
Xiaorong Sun
Keyword(s):  
Difference Graphs

scholarly journals Edge connectivity in difference graphs and some new constructions of partial sum families

2011 ◽  
Vol 32 (3) ◽  
pp. 352-360 ◽  
Author(s):  
Alexander Araluze ◽  
Klavdija Kutnar ◽  
Luis Martínez ◽  
Dragan Marušič
Keyword(s):  
Edge Connectivity ◽  
Partial Sum ◽  
Difference Graphs

scholarly journals On difference graphs and the local dimension of posets

2020 ◽  
Vol 86 ◽  
pp. 103074
Author(s):  
Jinha Kim ◽  
Ryan R. Martin ◽  
Tomáš Masařík ◽  
Warren Shull ◽  
Heather C. Smith ◽  
...  
Keyword(s):  
Local Dimension ◽  
Difference Graphs

scholarly journals Representation of finite graphs as difference graphs of S-units, I

2014 ◽  
Vol 127 ◽  
pp. 314-335 ◽  
Author(s):  
K. Győry ◽  
L. Hajdu ◽  
R. Tijdeman
Keyword(s):  
Finite Graphs ◽  
Difference Graphs

scholarly journals Properties of Random Difference Graphs

10.37236/2354 ◽  
2012 ◽  
Vol 19 (4) ◽  
Author(s):  
Christopher Ross
Keyword(s):  
Bipartite Graph ◽  
Exact Results ◽  
Matching Number ◽  
Random Generation ◽  
Difference Graphs ◽  
Random Difference

Generate a bipartite graph on a partitioned set of vertices by randomly assigning to each vertex $v$ some weight $w(v) \in [0,1]$ and adding an edge between vertices $u$ and $v$ (in distinct parts) if and only if $w(v) + w(v) > 1$; the results of such processes are known as difference graphs.Random difference graphs of a given size can be produced either by uniformly random generation of weights or by choosing a graph uniformly at random from the set of all such graphs. We prove that these two methods give rise to the same distribution, and use this equivalence to find exact results for the likelihood of connectivity and Hamiltonicity. We also find the distribution of other properties, such as matching number and degeneracy.

scholarly journals Some counterexamples to a conjecture on difference graphs

2021 ◽  
Vol 1 ◽  
pp. 100002
Author(s):  
L. Mella ◽  
A. Pasotti
Keyword(s):  
Difference Graphs

scholarly journals Fuzzy square difference labeling of some graphs

10.26524/cm93 ◽  
2021 ◽  
Vol 5 (1) ◽  
Author(s):  
Bharathi T ◽  
Jeya Rowena ◽  
Ashwini Sibiya Rani P
Keyword(s):  
Bipartite Graph ◽  
Complete Bipartite Graph ◽  
Star Graph ◽  
Path Graph ◽  
Difference Graphs ◽  
Cycle Graph

We introduced a new concept called the Fuzzy square difference labeling. We proved that the path graph (Pn), the cycle graph (Cn), the star graph (Sn) and the complete bipartite graph (Km,n, n ≤ 3) are Fuzzy square difference graphs.

scholarly journals Enumeration of difference graphs

1995 ◽  
Vol 60 (1-3) ◽  
pp. 311-318 ◽  
Author(s):  
Uri N. Peled ◽  
Feng Sun
Keyword(s):  
Difference Graphs
Sign in / Sign up

Export Citation Format

Share Document