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

DOI10.1016/0166-218X(93)90026-KMaRDI QIDQ689974zbMATHFDO

Authors 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

treesdeletiondominating setadditionconstructive characterizationvertex independence number

Mathematics Subject Classification ID

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

Recommendations

• Publication:4027332
• A CHARACTERIZATION OF STABLE GRAPHS ON A MAXIMUM(MINIMUM) NUMBER OF EDGES
• Publication:4393354
• \(k\)-independence stable graphs upon edge removal
• \(\alpha_k\)- and \(\gamma_k\)-stable graphs

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)

• scientific article; zbMATH DE number 5062002 (Why is no real title available?)
• \(\alpha_k\)- and \(\gamma_k\)-stable graphs
• Complexity of Stability.
• scientific article; zbMATH DE number 4112649 (Why is no real title available?)
• Graphs with a unique maximum independent set up to automorphisms
• Extremal graphs domination insensitive to the removal of \(k\) edges
• Combinatorial properties of the family of maximum stable sets of a graph
• A new greedoid: The family of local maximum stable sets of a forest
• Complexity of stability
• The structure and maximum number of maximum independent sets in trees
• \(k\)-domination and \(k\)-independence in graphs: A survey
• On the number of vertices belonging to all maximum stable sets of a graph
• On proper (1,2)‐dominating sets in graphs
• \(k\)-independence stable graphs upon edge removal
• scientific article; zbMATH DE number 125618 (Why is no real title available?)
• On local maximum stable set greedoids
• scientific article; zbMATH DE number 109199 (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)