Super-edge-connectivity and zeroth-order Randić index
From MaRDI portal
Publication:2278714
DOI10.1007/s40305-018-0221-7zbMath1438.05056OpenAlexW2894875074MaRDI QIDQ2278714
Publication date: 10 December 2019
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-018-0221-7
Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)
Cites Work
- Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected graphs
- On sharp bounds of the zero-order Randić index of certain unicyclic graphs
- Inverse degree and edge-connectivity
- Super edge-connectivity of dense digraphs and graphs
- Results on the edge-connectivity of graphs
- Degree sequence conditions for maximally edge-connected graphs depending on the clique number
- On unreliability polynomials and graph connectivity in reliable network synthesis
- On super-edge-connected digraphs and bipartite digraphs
- Inverse degree and super edge-connectivity
- A Graph-Theoretic Approach to a Communications Problem
- Asymptotic Formulas for the Probability of k-Connectedness of Random Graphs
- Maximally edge-connected graphs and zeroth-order general Randić index for \(\alpha\leq-1\)
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Super-edge-connectivity and zeroth-order Randić index
