Nullity of Graphs: An Updated Survey
Ivan Gutman, Bojana Borovićanin (2011)
Zbornik Radova
Similarity:
Displaying similar documents to “On -bounded families of graphs.”
Nullity of Graphs: An Updated Survey
Nullity of Graphs
Bijana Borovićanin, Ivan Gutman (2009)
Zbornik Radova
Similarity:
The sum of all distances in bipartite graphs
Ivan Gutman, Yeong Nan Yeh (1995)
Mathematica Slovaca
Similarity:
The number of labelled -arch graphs.
Lamathe, Cédric (2004)
Journal of Integer Sequences [electronic only]
Similarity:
Centers and centroids of unicyclic graphs
Mirosław Truszczyński (1985)
Mathematica Slovaca
Similarity:
L(2, 1)-Labelings of Some Families of Oriented Planar Graphs
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.
Selected Topics from the Theory of Graph Energy: Hypoenergetic Graph
Snježana Majstorović, Antoaneta Klobučar, Ivan Gutman (2009)
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...