Upper bounds on the domination number of a graph in terms of order and minimum degree.

MaRDI QIDQ5310205zbMATH OpenFDO

Authors Lutz Volkmann

Publication date 21 September 2007

zbMATH Keywords

domination numberminimum degree

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Tight upper bounds for the domination numbers of graphs with given order and minimum degree. II
• Tight upper bounds for the domination numbers of graphs with given order and minimum degree
• Upper bounds on the domination number of a graph in terms of order, diameter and minimum degree
• A NEW UPPER BOUND FOR THE DOMINATION NUMBER OF A GRAPH
• An upper bound on the domination number of a graph.

Cited in

(20)

• An upper bound on the domination number of a graph with minimum degree 2
• Domination number and neighbourhood conditions
• Tight upper bounds for the domination numbers of graphs with given order and minimum degree
• Tight upper bounds for the domination numbers of graphs with given order and minimum degree. II
• On the domination number of graphs with minimum degree six
• Upper bounds for the domination numbers of graphs using Turán's theorem and Lovász local lemma
• Vertex-addition strategy for domination-like invariants
• Improved upper bounds on the domination number of graphs with minimum degree at least five
• scientific article; zbMATH DE number 4031749 (Why is no real title available?)
• A linear vizing-like relation between the size and the domination number of a graph
• scientific article; zbMATH DE number 2076802 (Why is no real title available?)
• scientific article; zbMATH DE number 1472173 (Why is no real title available?)
• Common extremal graphs for three inequalities involving domination parameters
• Upper bounds on the domination number of a graph in terms of order, diameter and minimum degree
• scientific article; zbMATH DE number 2235063 (Why is no real title available?)
• A sharp upper bound on the least signless Laplacian eigenvalue using domination number
• Estimations for the domination number of a graph
• Domination, radius, and minimum degree
• A sharp upper bound on algebraic connectivity using domination number
• Domination in bipartite graphs

This page was built for publication: Upper bounds on the domination number of a graph in terms of order and minimum degree.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5310205)