Edge vulnerability parameters of split graphs

DOI10.1016/J.AML.2005.09.011zbMATH Open1120.05047OpenAlexW2094188386MaRDI QIDQ2371083FDOQ2371083

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

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

zbMATH Keywords

split graphedge-connectivityedge-toughnessedge-integrity

Mathematics Subject Classification ID

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

Cites Work

• Graph theory
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimal attack and reinforcement of a network
• Connectivity and edge-disjoint spanning trees
• The toughness of split graphs
• Title not available (Why is that?)

Cited In (5)

• Vulnerability of super connected split graphs and bisplit graphs
• Title not available (Why is that?)
• Edge vulnerability parameters of bisplit graphs
• Title not available (Why is that?)
• Maximally and super connected multisplit graphs and digraphs

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)