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

DOI10.1016/J.DISC.2012.06.023zbMATH Open1248.05123OpenAlexW2167844968MaRDI QIDQ456894FDOQ456894

Authors: Sylwia Cichacz, Mateusz Nikodem, Andrzej Żak, Agnieszka Görlich 

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

Recommendations

• General lower bound on the size of \((H; k)\)-stable graphs
• On \((C_n;k)\) stable graphs
• On (\(K_q;k\))-stable graphs
• (H,k) stable graphs with minimum size
• \((H,k)\) stable bipartite graphs with minimum size

zbMATH Keywords

minimum degreeconnectivityminimum sizevertex stable graphs

Mathematics Subject Classification ID

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

Cites Work

• On vertex stability with regard to complete bipartite subgraphs
• (H,k) stable graphs with minimum size
• \((H,k)\) stable bipartite graphs with minimum size
• 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

Cited In (7)

• On vertex stability of complete k-partite graphs
• A generalization of an independent set with application to \((K_q; k)\)-stable graphs
• On \((C_n;k)\) stable graphs
• \((H,k)\) stable bipartite graphs with minimum size
• General lower bound on the size of \((H; k)\)-stable graphs
• Bounding the size of a vertex-stabiliser in a finite vertex-transitive graph
• Minimum \(k\)-critical bipartite graphs

This page was built for publication: A lower bound on the size of \((H;1)\)-vertex stable graphs

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