Extremal graphs with given stability number and connectivity. II

zbMATH Open0985.05030MaRDI QIDQ2735515

Taoe Wu, Baoqiang Huang

Publication date: 20 May 2002

Published in: Journal of Central China Normal University. Natural Sciences (Search for Journal in Brave)

zbMATH Keywords

stability numberconnectivitydegree sumBC-closed graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Related Items (1)

Extremal graphs having no stable cutset

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity 👍 👎
• The stability number and connected \([k,k+1\)-factor in graphs] 👍 👎
• Lower bounds on the stability number of graphs computed in terms of degrees 👍 👎
• Stability of extremal hypergraphs with applications to an edge-coloring problem 👍 👎
• On the \(\rho \)-edge stability number of graphs 👍 👎
• Extremal graphs with given stability number and connectivity. I 👍 👎
• An extremal problem on the connectivity of graphs 👍 👎
• The algebraic connectivity of graphs with given stability number 👍 👎

This page was built for publication: Extremal graphs with given stability number and connectivity. II

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