Tight upper bounds for the domination numbers of graphs with given order and minimum degree
From MaRDI portal
Publication:1378519
zbMath0884.05057MaRDI QIDQ1378519
W. Edwin Clark, Larry A. Dunning
Publication date: 15 February 1998
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/119218
Related Items (9)
Improved upper bounds on the domination number of graphs with minimum degree at least five ⋮ Note on incidence chromatic number of subquartic graphs ⋮ Remoteness of permutation codes ⋮ Wireless networking, dominating and packing ⋮ On the domination number of Hamiltonian graphs with minimum degree six ⋮ A sharp upper bound on algebraic connectivity using domination number ⋮ Domination in graphs of minimum degree five ⋮ The incidence coloring conjecture for graphs of maximum degree 3 ⋮ 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
