Graphs whose vertex independence number is unaffected by single edge addition or deletion
From MaRDI portal
Publication:689974
DOI10.1016/0166-218X(93)90026-KzbMATH Open0792.05116MaRDI QIDQ689974FDOQ689974
Authors: Georg Gunther, Douglas F. Rall, Bert L. Hartnell
Publication date: 24 July 1994
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
Trees (05C05) Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)
Cites Work
Cited In (17)
- Title not available (Why is that?)
- Extremal graphs domination insensitive to the removal of \(k\) edges
- Graphs with a unique maximum independent set up to automorphisms
- \(k\)-independence stable graphs upon edge removal
- \(k\)-domination and \(k\)-independence in graphs: A survey
- On proper (1,2)‐dominating sets in graphs
- Complexity of stability
- Title not available (Why is that?)
- \(\alpha_k\)- and \(\gamma_k\)-stable graphs
- On the number of vertices belonging to all maximum stable sets of a graph
- On local maximum stable set greedoids
- The structure and maximum number of maximum independent sets in trees
- A new greedoid: The family of local maximum stable sets of a forest
- Combinatorial properties of the family of maximum stable sets of a graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complexity of Stability.
This page was built for publication: Graphs whose vertex independence number is unaffected by single edge addition or deletion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q689974)