Vulnerability of super connected split graphs and bisplit graphs

DOI10.3934/dcdss.2019081zbMath1419.05114OpenAlexW2900513301WikidataQ128862073 ScholiaQ128862073MaRDI QIDQ2321673

Litao Guo, Bernard L. S. Lin

Publication date: 23 August 2019

Published in: Discrete and Continuous Dynamical Systems. Series S (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/dcdss.2019081

zbMATH Keywords

split graphssuper connectivitybisplit graphssuper edge connectivity

Mathematics Subject Classification ID

Applications of graph theory (05C90) Connectivity (05C40)

Related Items (2)

Short cycles dictate dichotomy status of the Steiner tree problem on bisplit graphs ⋮ Maximally and super connected multisplit graphs and digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Super connectivity of Kronecker products of graphs
• The toughness of split graphs
• Super-connectivity of Kronecker products of split graphs, powers of cycles, powers of paths and complete graphs
• Edge vulnerability parameters of split graphs
• Edge vulnerability parameters of bisplit graphs
• Bisplit graphs
• Vulnerability parameters of split graphs

This page was built for publication: Vulnerability of super connected split graphs and bisplit graphs