Maximally and super connected multisplit graphs and digraphs

DOI10.2298/AADM170716024GzbMath1499.05122MaRDI QIDQ5028804

Xingke Zhao, Lutz Volkmann, Litao Guo, Guifu Su

Publication date: 10 February 2022

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

zbMATH Keywords

maximally edge-connectedzeroth-order general Randić indexsuper-edge-connected\(k\)-multisplit graphs, digraphs

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Super connectivity of Kronecker products of graphs
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• On sharp bounds of the zero-order Randić index of certain unicyclic graphs
• The toughness of split graphs
• Super-connectivity of Kronecker products of split graphs, powers of cycles, powers of paths and complete graphs
• Vulnerability of super connected split graphs and bisplit graphs
• Edge vulnerability parameters of split graphs
• Maximally edge-connected graphs and zeroth-order general Randić index for \(0<\alpha <1\)
• Edge vulnerability parameters of bisplit graphs
• Bisplit graphs
• Sufficient conditions on the zeroth-order general Randic index for maximally edge-connected digraphs
• Vulnerability parameters of split graphs
• Isometries in Normed Spaces
• Inequalities: theory of majorization and its applications
• Maximally edge-connected graphs and zeroth-order general Randić index for \(\alpha\leq-1\)

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