Maximally and super connected multisplit graphs and digraphs

DOI10.2298/AADM170716024GMaRDI QIDQ5028804zbMATH OpenWikidataFDO

Authors Litao Guo, Guifu Su, Lutz Volkmann, Xingke Zhao

Publication date 10 February 2022

Published in Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

super-edge-connectedmaximally edge-connectedzeroth-order general Randić index\(k\)-multisplit graphs, digraphs

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)

Recommendations

• Maximally connected digraphs
• Superconnectivity of bipartite digraphs and graphs
• The superconnectivity of large digraphs and graphs
• On super-edge-connected digraphs and bipartite digraphs
• Sufficient conditions for digraphs to be maximally connected and super-connected
• scientific article; zbMATH DE number 1933046
• scientific article; zbMATH DE number 4162914
• Super connectivity of line graphs and digraphs
• On super i‐connected graphs
• Super-connectivity of Kronecker products of split graphs, powers of cycles, powers of paths and complete graphs

Cites work

• scientific article; zbMATH DE number 3632548 (Why is no real title available?)
• scientific article; zbMATH DE number 3297026 (Why is no real title available?)
• Bisplit graphs
• Edge vulnerability parameters of bisplit graphs
• Edge vulnerability parameters of split graphs
• Graph theory with applications
• Inequalities: theory of majorization and its applications
• Isometries in Normed Spaces
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• Maximally edge-connected graphs and zeroth-order general Randić index for \(0<\alpha <1\)
• Maximally edge-connected graphs and zeroth-order general Randić index for \(\alpha\leq-1\)
• On sharp bounds of the zero-order Randić index of certain unicyclic graphs
• Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected digraphs
• 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 of super connected split graphs and bisplit graphs
• Vulnerability parameters of split graphs

Cited in

(2)

• Vertex fault tolerance of \(G(G_0,G_1;M)\) networks with respect to maximally connectivity
• Vulnerability of super connected split graphs and bisplit graphs

This page was built for publication: Maximally and super connected multisplit graphs and digraphs

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