Extremal graphs domination insensitive to the removal of k edges
From MaRDI portal
Publication:686272
DOI10.1016/0166-218X(93)90238-JzbMATH Open0783.05060OpenAlexW2006026530MaRDI QIDQ686272FDOQ686272
Robert Brigham, Ronald D. Dutton, Teresa W. Haynes
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
Recommendations
Cites Work
- Parallel concepts in graph theory
- Vertex domination-critical graphs
- Domination alteration sets in graphs
- Domination critical graphs
- Domination critical graphs
- Title not available (Why is that?)
- On diameter 2-critical graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graphs whose vertex independence number is unaffected by single edge addition or deletion
- An extremal problem for edge domination insensitive graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theg-network and its inherent fault tolerant properties
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (5)
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)
