Edge vulnerability parameters of split graphs

DOI10.1016/j.aml.2005.09.011zbMath1120.05047OpenAlexW2094188386MaRDI QIDQ2371083

Qilong Zhang, Sheng Gui 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

split graphedge-connectivityedge-toughnessedge-integrity

Mathematics Subject Classification ID

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

Related Items

Edge vulnerability parameters of bisplit graphs ⋮ Vulnerability of super connected split graphs and bisplit graphs ⋮ Unnamed Item ⋮ Maximally and super connected multisplit graphs and digraphs

Cites Work

• The toughness of split graphs
• Connectivity and edge-disjoint spanning trees
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Optimal attack and reinforcement of a network
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item