Edge vulnerability parameters of bisplit graphs

DOI10.1016/J.CAMWA.2008.04.015MaRDI QIDQ2519517zbMATH OpenOpenAlexFDO

Authors Metrose Metsidik, Vumar Elkin

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-connectivityminimum vertex degreeedge-toughnessedge-integritybisplit graph

Mathematics Subject Classification ID

Connectivity (05C40)

Recommendations

• Edge vulnerability parameters of split graphs
• Vulnerability of super connected split graphs and bisplit graphs
• scientific article; zbMATH DE number 1339493
• Some results on the edge hub-integrity of graphs
• Bisplit graphs

Cites work

• 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?)
• scientific article; zbMATH DE number 3503283 (Why is no real title available?)
• scientific article; zbMATH DE number 3632548 (Why is no real title available?)
• A note on the recognition of bisplit graphs
• Bisplit graphs
• Connectivity and edge-disjoint spanning trees
• Edge vulnerability parameters of split graphs
• Edge-Disjoint Spanning Trees of Finite Graphs
• Graph theory
• On the Problem of Decomposing a Graph into n Connected Factors
• Some simplified NP-complete graph problems
• The toughness of split graphs
• Vulnerability parameters of split graphs

Cited in

(4)

• Vulnerability of super connected split graphs and bisplit graphs
• Maximally and super connected multisplit graphs and digraphs
• Toughness of the corona of two graphs
• Edge vulnerability parameters of split graphs

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

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