Vulnerability of super connected split graphs and bisplit graphs

DOI10.3934/DCDSS.2019081MaRDI QIDQ2321673zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

bisplit graphssplit graphssuper connectivitysuper edge connectivity

Mathematics Subject Classification ID

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

Recommendations

• Edge vulnerability parameters of bisplit graphs
• Super-\(\lambda \) connectivity of bipartite graphs.
• Super-connectivity and hyper-connectivity of vertex transitive bipartite graphs
• On super i‐connected graphs
• Maximally and super connected multisplit graphs and digraphs

Cites work

• Bisplit graphs
• Edge vulnerability parameters of bisplit graphs
• Edge vulnerability parameters of split graphs
• Graph theory with applications
• scientific article; zbMATH DE number 3632548 (Why is no real title available?)
• Super connectivity of Kronecker products of graphs
• Super-connectivity of Kronecker products of split graphs, powers of cycles, powers of paths and complete graphs
• The toughness of split graphs
• Vulnerability parameters of split graphs

Cited in

(5)

• Edge vulnerability parameters of split graphs
• Edge vulnerability parameters of bisplit graphs
• Maximally and super connected multisplit graphs and digraphs
• Short cycles dictate dichotomy status of the Steiner tree problem on bisplit graphs
• Bisplit graphs -- a structural and algorithmic study

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

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