Edge rotations and distance between graphs
Gary Chartrand, Farrokh Saba, Hung Bin Zou (1985)
Časopis pro pěstování matematiky
Similarity:
Gary Chartrand, Farrokh Saba, Hung Bin Zou (1985)
Časopis pro pěstování matematiky
Similarity:
Yamanaka, Katsuhisa, Nakano, Shin-Ichi (2009)
Journal of Graph Algorithms and Applications
Similarity:
Juraj Bosák (1984)
Mathematica Slovaca
Similarity:
David Burns, S. Kapoor, P. Ostrand (1985)
Fundamenta Mathematicae
Similarity:
Yuefang Sun (2016)
Discussiones Mathematicae Graph Theory
Similarity:
The generalized k-connectivity κk(G) of a graph G was introduced by Hager in 1985. As a natural counterpart of this concept, Li et al. in 2011 introduced the concept of generalized k-edge-connectivity which is defined as λk(G) = min{λ(S) : S ⊆ V (G) and |S| = k}, where λ(S) denote the maximum number ℓ of pairwise edge-disjoint trees T1, T2, . . . , Tℓ in G such that S ⊆ V (Ti) for 1 ≤ i ≤ ℓ. In this paper, we study the generalized edge- connectivity of product graphs and obtain sharp...
Bohdan Zelinka (1987)
Časopis pro pěstování matematiky
Similarity:
Gerhard Benadé, Wayne Goddard, Terry A. McKee, Paul A. Winter (1991)
Mathematica Bohemica
Similarity:
In 1986, Chartrand, Saba and Zou [3] defined a measure of the distance between (the isomorphism classes of) two graphs based on 'edge rotations'. Here, that measure and two related measures are explored. Various bounds, exact values for classes of graphs and relationships are proved, and the three measures are shown to be intimately linked to 'slowly-changing' parameters.
Dean, Alice M., Evans, William, Gethner, Ellen, Laison, Joshua D., Safari, Mohammad Ali, Trotter, William T. (2007)
Journal of Graph Algorithms and Applications
Similarity: