On equality in an upper bound for domination parameters of graphs

DOI10.1002/(SICI)1097-0118(199703)24:3%3C221::AID-JGT3%3E3.0.CO;2-RMaRDI QIDQ3122896zbMATHOpenAlexFDO

Authors Odile Favaron, Christina M. Mynhardt

Publication date 7 October 1997

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199703)24:3%3C221::aid-jgt3%3E3.0.co;2-r

zbMATH Keywords

domination numberdominating setindependence numberirredundance numberirredundant sets

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• The sequence of upper and lower domination, independence and irredundance numbers of a graph
• scientific article; zbMATH DE number 1933059
• Forbidden graphs and irredundant perfect graphs
• A note on total domination

Cited in

(12)

• On equality in an upper bound for the equivalence domination number
• A survey of stratified domination in graphs
• Some bounds on domination related parameters
• On equality in an upper bound for the domination number with respect to nondegenerate properties
• scientific article; zbMATH DE number 1933059 (Why is no real title available?)
• Extremal graphs for a new upper bound on domination parameters in graphs
• Total restrained domination in graphs with minimum degree two
• Private domination number of a graph
• An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree
• Irredundance
• On equality in an upper bound for the restrained and total domination numbers of a graph
• Partial domination and irredundance numbers in graphs

This page was built for publication: On equality in an upper bound for domination parameters of graphs

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