An identity for the independence polynomials of trees.
Gutman, Ivan (1991)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Displaying similar documents to “Inequalities between distance-based graph polynomials”
An identity for the independence polynomials of trees.
Nullity of Graphs
Bijana Borovićanin, Ivan Gutman (2009)
Zbornik Radova
Similarity:
Regular graphs and their spanning trees
Jiří Sedláček (1970)
Časopis pro pěstování matematiky
Similarity:
On -bounded families of graphs.
Gyárfás, András, Zaker, Manouchehr (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Nullity of Graphs: An Updated Survey
Ivan Gutman, Bojana Borovićanin (2011)
Zbornik Radova
Similarity:
On Graphs with Disjoint Dominating and 2-Dominating Sets
Michael A. Henning, Douglas F. Rall (2013)
Discussiones Mathematicae Graph Theory
Similarity:
A DD2-pair of a graph G is a pair (D,D2) of disjoint sets of vertices of G such that D is a dominating set and D2 is a 2-dominating set of G. Although there are infinitely many graphs that do not contain a DD2-pair, we show that every graph with minimum degree at least two has a DD2-pair. We provide a constructive characterization of trees that have a DD2-pair and show that K3,3 is the only connected graph with minimum degree at least three for which D ∪ D2 necessarily contains all vertices...
The sum of all distances in bipartite graphs
Ivan Gutman, Yeong Nan Yeh (1995)
Mathematica Slovaca
Similarity:
Steiner distance in graphs
Gary Chartrand, Ortrud R. Oellermann, Song Lin Tian, Hung Bin Zou (1989)
Časopis pro pěstování matematiky
Similarity:
Salem numbers, Pisot numbers, Mahler measure, and graphs.
McKee, James, Smyth, Chris (2005)
Experimental Mathematics
Similarity: