Tight upper bounds for the domination numbers of graphs with given order and minimum degree.
Clark, W.Edwin, Dunning, Larry A. (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “The modified negative decision number in graphs.”
Tight upper bounds for the domination numbers of graphs with given order and minimum degree.
A new upper bound on the total domination number of a graph.
Henning, Michael A., Yeo, Anders (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dense -free graphs are almost -partite.
Allen, Peter (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Randomly complete -partite graphs
Yousef Alavi, Don R. Lick, Song Lin Tian (1989)
Mathematica Slovaca
Similarity:
Graphs with prescribed neighbourhood graphs
Bohdan Zelinka (1985)
Mathematica Slovaca
Similarity:
One-two descriptor of graphs
K. CH. Das, I. Gutman, D. Vukičević (2011)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity:
Induced complete -partite graphs in dense clique-less graphs.
Fischer, Eldar (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity: