Graphs whose vertex independence number is unaffected by single edge addition or deletion
From MaRDI portal
(Redirected from Publication:689974)
Recommendations
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 3549014 (Why is no real title available?)
- An extremal problem for edge domination insensitive graphs
- Domination alteration sets in graphs
- Domination critical graphs
- Graphs with unique maximum independent sets
- Vertex domination-critical graphs
Cited in
(17)- Complexity of Stability.
- Extremal graphs domination insensitive to the removal of k edges
- scientific article; zbMATH DE number 4112649 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 125618 (Why is no real title available?)
- \(\alpha_k\)- and \(\gamma_k\)-stable graphs
- On local maximum stable set greedoids
- On the number of vertices belonging to all maximum stable sets of a graph
- 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
- scientific article; zbMATH DE number 109199 (Why is no real title available?)
- scientific article; zbMATH DE number 5062002 (Why is no real title available?)
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)