Maximally and super connected multisplit graphs and digraphs
DOI10.2298/AADM170716024GzbMATH Open1499.05122WikidataQ128754939 ScholiaQ128754939MaRDI QIDQ5028804FDOQ5028804
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)
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
- 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
super-edge-connectedmaximally edge-connectedzeroth-order general Randić index\(k\)-multisplit graphs, digraphs
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)
Cites Work
- Inequalities: theory of majorization and its applications
- Graph theory with applications
- Title not available (Why is that?)
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Super-connectivity of Kronecker products of split graphs, powers of cycles, powers of paths and complete graphs
- Super connectivity of Kronecker products of graphs
- Bisplit graphs
- Isometries in Normed Spaces
- Title not available (Why is that?)
- On sharp bounds of the zero-order Randić index of certain unicyclic graphs
- Maximally edge-connected graphs and zeroth-order general Randić index for \(0<\alpha <1\)
- The toughness of split graphs
- Vulnerability parameters of split graphs
- Maximally edge-connected graphs and zeroth-order general Randić index for \(\alpha\leq-1\)
- Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected digraphs
- Vulnerability of super connected split graphs and bisplit graphs
- Edge vulnerability parameters of split graphs
- Edge vulnerability parameters of bisplit graphs
Cited In (2)
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)
