Regular graphs and their spanning trees
Jiří Sedláček (1970)
Časopis pro pěstování matematiky
Similarity:
Jiří Sedláček (1970)
Časopis pro pěstování matematiky
Similarity:
Jiří Sedláček (1967)
Časopis pro pěstování matematiky
Similarity:
Brualdi, Richard A., Mellendorf, Stephen (1994)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Suresh Dara, S.M. Hegde, Venkateshwarlu Deva, S.B. Rao, Thomas Zaslavsky (2016)
Discussiones Mathematicae Graph Theory
Similarity:
In 1966, Cummins introduced the “tree graph”: the tree graph T(G) of a graph G (possibly infinite) has all its spanning trees as vertices, and distinct such trees correspond to adjacent vertices if they differ in just one edge, i.e., two spanning trees T1 and T2 are adjacent if T2 = T1 − e + f for some edges e ∈ T1 and f ∉ T1. The tree graph of a connected graph need not be connected. To obviate this difficulty we define the “forest graph”: let G be a labeled graph of order α, finite...
Jiří Sedláček (1969)
Časopis pro pěstování matematiky
Similarity:
Sagnik Sen (2014)
Discussiones Mathematicae Graph Theory
Similarity:
In this paper we determine, or give lower and upper bounds on, the 2-dipath and oriented L(2, 1)-span of the family of planar graphs, planar graphs with girth 5, 11, 16, partial k-trees, outerplanar graphs and cacti.
Dobrynin, A., Gutman, I. (1994)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity: