Extremal graphs domination insensitive to the removal of \(k\) edges

DOI10.1016/0166-218X(93)90238-JzbMath0783.05060OpenAlexW2006026530MaRDI QIDQ686272

Robert C. Brigham, Teresa W. Haynes, Ronald D. Dutton

Publication date: 28 November 1993

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

Full work available at URL: https://doi.org/10.1016/0166-218x(93)90238-j

zbMATH Keywords

extremal graphsboundsdominating setdomination numberinsensitive graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (2)

Complexity of stability ⋮ Complexity of Stability.

Cites Work

• Domination alteration sets in graphs
• Graphs whose vertex independence number is unaffected by single edge addition or deletion
• On diameter 2-critical graphs
• An extremal problem for edge domination insensitive graphs
• Parallel concepts in graph theory
• Vertex domination-critical graphs
• Theg-network and its inherent fault tolerant properties
• Domination critical graphs
• Domination critical graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Extremal graphs domination insensitive to the removal of \(k\) edges