A characterization of the decay number of a connected graph
Ladislav Nebeský (1995)
Mathematica Slovaca
Similarity:
Ladislav Nebeský (1995)
Mathematica Slovaca
Similarity:
Hung-Lin Fu, Martin Škoviera, Ming-Chun Tsai (1998)
Czechoslovak Mathematical Journal
Similarity:
In this paper we determine the maximum genus of a graph by using the matching number of the intersection graph of a basis of its cycle space. Our result is a common generalization of a theorem of Glukhov and a theorem of Nebeský .
Ladislav Nebeský (1981)
Czechoslovak Mathematical Journal
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...