Domination and irredundance in cubic graphs

DOI10.1016/S0012-365X(96)00229-4zbMath0873.05056OpenAlexW2056606203MaRDI QIDQ1356461

E. J. Cockayne, Christina M. Mynhardt

Publication date: 29 October 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00229-4

zbMATH Keywords

extremal graphsdominating numbercubic graphirredundance number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (4)

Independence and upper irredundance in claw-free graphs ⋮ The complexity of irredundant sets parameterized by size ⋮ Enumeration and maximum number of maximal irredundant sets for chordal graphs ⋮ Irredundance

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on graphs which have upper irredundance equal to independence
• On domination and independent domination numbers of a graph
• What is the difference between the domination and independent domination numbers of a cubic graph?
• Two relations between the parameters of independence and irredundance
• Contributions to the theory of domination, independence and irredundance in graphs
• Chordal graphs and upper irredundance, upper domination and independence
• Inequalities relating domination parameters in cubic graphs
• A counterexample to conjecture of Barefoot, Harary, and Jones
• Graph-theoretic parameters concerning domination, independence, and irredundance
• Stability, domination and irredundance in a graph
• Properties of Hereditary Hypergraphs and Middle Graphs

This page was built for publication: Domination and irredundance in cubic graphs