A lower bound on the size of \((H;1)\)-vertex stable graphs

DOI10.1016/j.disc.2012.06.023zbMath1248.05123OpenAlexW2167844968MaRDI QIDQ456894

Sylwia Cichacz, Andrzej Żak, Mateusz Nikodem, Agnieszka Goerlich

Publication date: 16 October 2012

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

Full work available at URL: https://doi.org/10.1016/j.disc.2012.06.023

zbMATH Keywords

connectivityminimum degreeminimum sizevertex stable graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

On vertex stability of complete k-partite graphs ⋮ General lower bound on the size of \((H; k)\)-stable graphs ⋮ Minimum \(k\)-critical bipartite graphs ⋮ A generalization of an independent set with application to \((K_q; k)\)-stable graphs

Cites Work

• On \((K_q,k)\) vertex stable graphs with minimum size
• On \((K_{q},k)\) stable graphs with small \(k\)
• On \((C_n;k)\) stable graphs
• On vertex stability with regard to complete bipartite subgraphs
• (H,k) stable graphs with minimum size
• (H,k) stable bipartite graphs with the minimum size