Extremal graphs for a new upper bound on domination parameters in graphs

DOI10.1016/J.DISC.2005.12.029MaRDI QIDQ2433699zbMATH OpenOpenAlexFDO

Authors Mostafa Blidia, Mustapha Chellali, Frédéric Maffray

Publication date 30 October 2006

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2005.12.029

zbMATH Keywords

irredundance

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Review text

The authors improve an inequality on the domination number of a graph established by Berge and others, and give a characterization of the trees that achieve equality in the established inequality.

Recommendations

• A general method in the theory of domination in graphs
• Extremal perfect graphs for a bound on the domination number
• Maximum sizes of graphs with given domination parameters
• Some upper bounds related with domination number
• A note on the number of dominating sets of a graph

Cites work

• Domination-balanced graphs
• Gallai-type theorems and domination parameters
• scientific article; zbMATH DE number 3159208 (Why is no real title available?)
• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 3522018 (Why is no real title available?)
• scientific article; zbMATH DE number 3614795 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 3338381 (Why is no real title available?)
• scientific article; zbMATH DE number 3341035 (Why is no real title available?)
• On equality in an upper bound for domination parameters of graphs
• On graphs having domination number half their order
• Paths, Trees, and Flowers
• Properties of Hereditary Hypergraphs and Middle Graphs
• Relations between parameters of a graph

Cited in

(9)

• Relations between the lower domination parameters and the chromatic number of a graph.
• Independent domination of graphs with bounded maximum degree
• Extended chain of domination parameters in graphs
• Irredundance
• An inequality chain of domination parameters for trees
• On average lower independence and domination numbers in graphs
• Upper whole domination in a graph
• Upper bounds for \(\alpha \)-domination parameters
• Extremal perfect graphs for a bound on the domination number

This page was built for publication: Extremal graphs for a new upper bound on domination parameters in graphs

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