Lower bounds for the domination number

DOI10.7151/dmgt.1508zbMath1217.05177OpenAlexW2014711952MaRDI QIDQ2997606

Bill Waller, Ermelinda DeLaViña, Ryan Pepper

Publication date: 9 May 2011

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.533.7718

zbMATH Keywords

matchingradiusdomination numbercut-vertices

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (12)

The \(\mathbb{N}_k\)-valued Roman domination and its boundaries ⋮ A new lower bound for the total domination number in graphs proving a Graffiti.pc conjecture ⋮ Bounds for the Grundy chromatic number of graphs in terms of domination number ⋮ Domination on hyperbolic graphs ⋮ On domination number and distance in graphs ⋮ Unnamed Item ⋮ Domination number and Laplacian eigenvalue of trees ⋮ On the Domination Integrity ⋮ Unnamed Item ⋮ A new lower bound on the domination number of a graph ⋮ Upper paired domination versus upper domination ⋮ A classification of cactus graphs according to their domination number

This page was built for publication: Lower bounds for the domination number