Graphs whose vertex independence number is unaffected by single edge addition or deletion

DOI10.1016/0166-218X(93)90026-KzbMath0792.05116MaRDI QIDQ689974

Georg Gunther, Douglas F. Rall, Bert L. Hartnell

Publication date: 24 July 1994

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

zbMATH Keywords

treesadditiondominating setvertex independence numberdeletionconstructive characterization

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Related Items (11)

The structure and maximum number of maximum independent sets in trees ⋮ Graphs with a unique maximum independent set up to automorphisms ⋮ Combinatorial properties of the family of maximum stable sets of a graph ⋮ On proper (1,2)‐dominating sets in graphs ⋮ On local maximum stable set greedoids ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ Complexity of stability ⋮ Complexity of Stability. ⋮ Extremal graphs domination insensitive to the removal of \(k\) edges ⋮ On the number of vertices belonging to all maximum stable sets of a graph ⋮ A new greedoid: The family of local maximum stable sets of a forest

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Domination alteration sets in graphs
• Graphs with unique maximum independent sets
• An extremal problem for edge domination insensitive graphs
• Vertex domination-critical graphs
• Domination critical graphs

This page was built for publication: Graphs whose vertex independence number is unaffected by single edge addition or deletion