A CHARACTERIZATION OF STABLE GRAPHS ON A MAXIMUM(MINIMUM) NUMBER OF EDGES

DOI10.1080/16073606.1986.9631602MaRDI QIDQ3745876zbMATH OpenOpenAlexFDO

Authors Wayne Goddard, Paul August Winter

Publication date 1986

Published in Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/16073606.1986.9631602

zbMATH Keywords

stable graphsdestructibility of graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Recommendations

• On the number of vertices belonging to all maximum stable sets of a graph
• On minimum \((K_q, k)\) stable graphs
• A note on stability for maximal \(F\)-free graphs
• On the \(\rho \)-edge stability number of graphs
• A stability theorem for maximal \(K_{r+1}\)-free graphs
• Extremal graphs with given stability number and connectivity. I
• A stability theorem for maximal C2k+1 ${C}_{2k+1}$‐free graphs
• scientific article; zbMATH DE number 4063144
• On \((K_q,k)\) vertex stable graphs with minimum size
• On the stable degree of graphs

Cites work

• Graph theory with applications
• ON STABLE GRAPHS
• ON α,β DESTRUCTIBLE GRAPHS

Cited in

(5)

• On automorphisms of direct products of Cayley graphs on abelian groups
• ALL GRAPHS ON A NON-PRIME NUMBER OF VERTICES ARE DESTRUCTIBLE
• On the number of vertices belonging to all maximum stable sets of a graph
• Graphs whose vertex independence number is unaffected by single edge addition or deletion
• ON STABLE GRAPHS

This page was built for publication: A CHARACTERIZATION OF STABLE GRAPHS ON A MAXIMUM(MINIMUM) NUMBER OF EDGES

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3745876)