Nordhaus-Gaddum Bounds for Domination Sums in Graphs With Specified Minimum Degree
Document Type
Article
Publication Date
5-1-2005
Description
A set S ⊆ V is a dominating set in a graph G = (V, E) if each vertex in V-S is adjacent to at least one vertex in S. The domination number γ(G) is the minimum cardinality of a dominating set in G. We find improved bounds for γ(G) + γ(G) for graphs which have a given minimum degree.
Citation Information
Dunbar, Jean E.; Haynes, Teresa W.; and Hedetniemi, Stephen T.. 2005. Nordhaus-Gaddum Bounds for Domination Sums in Graphs With Specified Minimum Degree. Utilitas Mathematica. Vol.67 97-105. ISSN: 0315-3681