Inequalities between distance-based graph polynomials
I. Gutman, Olga Miljković, B. Zhou, M. Petrović (2006)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity:
I. Gutman, Olga Miljković, B. Zhou, M. Petrović (2006)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity:
Bohdan Zelinka (1990)
Časopis pro pěstování matematiky
Similarity:
K. CH. Das, I. Gutman, D. Vukičević (2011)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity:
Gutman, Ivan, Fuji, Zhang (1986)
Publications de l'Institut Mathématique. Nouvelle Série
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...
Gutman, Ivan (1992)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Goldberg, Mark K., Magdon-Ismail, Malik (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bohdan Zelinka (1980)
Czechoslovak Mathematical Journal
Similarity:
Van Bussel, Frank (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Gyárfás, András, Zaker, Manouchehr (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity: