Edge vulnerability parameters of split graphs

DOI10.1016/J.AML.2005.09.011MaRDI QIDQ2371083zbMATH OpenOpenAlexFDO

Authors Qilong Zhang, Shenggui Zhang

Publication date 29 June 2007

Published in Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.aml.2005.09.011

zbMATH Keywords

edge-connectivityedge-integrityedge-toughnesssplit graph

Mathematics Subject Classification ID

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

Review text

The authors prove that for a noncomplete connected split graph, its edge-connectivity equals its minimum degree. A formula is derived for computing the edge-toughness of noncomplete connected split graphs. Lastly, the authors show that the edge-integrity of a noncomplete connected split graph equals its order when its minimum degree is greater than half of the size of its largest clique.

Recommendations

• Edge vulnerability parameters of bisplit graphs
• Vulnerability parameters of split graphs
• Vulnerability of some splitting graphs
• Vulnerability of super connected split graphs and bisplit graphs
• Vulnerability of super extra edge-connected graphs
• Vulnerability parameters of double graphs
• A measure of graphs vulnerability: edge scattering number
• Diameter vulnerability of graphs by edge deletion
• Diameter vulnerability of graphs
• Split domination vertex critical and edge critical graphs

Cites work

• Connectivity and edge-disjoint spanning trees
• Edge-Disjoint Spanning Trees of Finite Graphs
• Graph theory
• scientific article; zbMATH DE number 4130410 (Why is no real title available?)
• scientific article; zbMATH DE number 4053662 (Why is no real title available?)
• scientific article; zbMATH DE number 4085694 (Why is no real title available?)
• On the Problem of Decomposing a Graph into n Connected Factors
• Optimal attack and reinforcement of a network
• The toughness of split graphs

Cited in

(5)

• Vulnerability of super connected split graphs and bisplit graphs
• Edge vulnerability parameters of bisplit graphs
• scientific article; zbMATH DE number 1933267 (Why is no real title available?)
• Maximally and super connected multisplit graphs and digraphs
• scientific article; zbMATH DE number 7310279 (Why is no real title available?)

This page was built for publication: Edge vulnerability parameters of split graphs

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