Tight upper bounds for the domination numbers of graphs with given order and minimum degree. II
From MaRDI portal
Publication:1589861
zbMath0959.05086MaRDI QIDQ1589861
Publication date: 12 December 2000
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/120897
05C35: Extremal problems in graph theory
05B10: Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items