Nullity of Graphs: An Updated Survey
Ivan Gutman, Bojana Borovićanin (2011)
Zbornik Radova
Similarity:
Ivan Gutman, Bojana Borovićanin (2011)
Zbornik Radova
Similarity:
Bijana Borovićanin, Ivan Gutman (2009)
Zbornik Radova
Similarity:
Ivan Gutman, Yeong Nan Yeh (1995)
Mathematica Slovaca
Similarity:
Lamathe, Cédric (2004)
Journal of Integer Sequences [electronic only]
Similarity:
Mirosław Truszczyński (1985)
Mathematica Slovaca
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.
Snježana Majstorović, Antoaneta Klobučar, Ivan Gutman (2009)
Zbornik Radova
Similarity:
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...
David E. Brown, Breeann M. Flesch, J. Richard (2014)
Discussiones Mathematicae Graph Theory
Similarity:
A graph is a probe interval graph if its vertices correspond to some set of intervals of the real line and can be partitioned into sets P and N so that vertices are adjacent if and only if their corresponding intervals intersect and at least one belongs to P. We characterize the 2-trees which are probe interval graphs and extend a list of forbidden induced subgraphs for such graphs created by Pržulj and Corneil in [2-tree probe interval graphs have a large obstruction set, Discrete Appl....
Adamaszek, Anna, Adamaszek, Michał (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity: