Extremal graphs domination insensitive to the removal of k edges

DOI10.1016/0166-218X(93)90238-JMaRDI QIDQ686272zbMATH OpenOpenAlexFDO

Authors Teresa W. Haynes, Robert Brigham, 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

domination numberboundsdominating setextremal graphsinsensitive graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• scientific article; zbMATH DE number 1416468
• scientific article; zbMATH DE number 4114673
• An extremal problem for edge domination insensitive graphs
• \(k\)-domination stable graphs upon edge removal.
• Domination Numbers in Graphs with Removed Edge or Set of Edges

Cites work

• scientific article; zbMATH DE number 4139777 (Why is no real title available?)
• scientific article; zbMATH DE number 4139778 (Why is no real title available?)
• scientific article; zbMATH DE number 3961651 (Why is no real title available?)
• scientific article; zbMATH DE number 26480 (Why is no real title available?)
• scientific article; zbMATH DE number 68339 (Why is no real title available?)
• scientific article; zbMATH DE number 109199 (Why is no real title available?)
• scientific article; zbMATH DE number 4126674 (Why is no real title available?)
• scientific article; zbMATH DE number 1043884 (Why is no real title available?)
• scientific article; zbMATH DE number 4114673 (Why is no real title available?)
• scientific article; zbMATH DE number 3807642 (Why is no real title available?)
• scientific article; zbMATH DE number 975360 (Why is no real title available?)
• An extremal problem for edge domination insensitive graphs
• Domination alteration sets in graphs
• Domination critical graphs
• Domination critical graphs
• Graphs whose vertex independence number is unaffected by single edge addition or deletion
• On diameter 2-critical graphs
• Parallel concepts in graph theory
• Theg-network and its inherent fault tolerant properties
• Vertex domination-critical graphs

Cited in

(6)

• Complexity of Stability.
• scientific article; zbMATH DE number 1416468 (Why is no real title available?)
• An extremal problem for edge domination insensitive graphs
• \(k\)-domination stable graphs upon edge removal.
• Complexity of stability
• scientific article; zbMATH DE number 4114673 (Why is no real title available?)

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

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