Edge vulnerability parameters of bisplit graphs

DOI10.1016/j.camwa.2008.04.015zbMath1152.05342OpenAlexW2024134091MaRDI QIDQ2519517

Elkin Vumar, Metrose Metsidik

Publication date: 26 January 2009

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2008.04.015

zbMATH Keywords

edge-connectivityedge-toughnessminimum vertex degreeedge-integritybisplit graph

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items

Toughness of the corona of two graphs ⋮ Vulnerability of super connected split graphs and bisplit graphs ⋮ Maximally and super connected multisplit graphs and digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some simplified NP-complete graph problems
• The toughness of split graphs
• Connectivity and edge-disjoint spanning trees
• Edge vulnerability parameters of split graphs
• A note on the recognition of bisplit graphs
• Bisplit graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Vulnerability parameters of split graphs