Tight upper bounds for the domination numbers of graphs with given order and minimum degree. II

zbMath0959.05086MaRDI QIDQ1589861

W. Edwin Clark, Stephen Suen

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

zbMATH Keywords

minimum degreedominating setdomination number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

A Survey of the Game “Lights Out!”

This page was built for publication: Tight upper bounds for the domination numbers of graphs with given order and minimum degree. II