Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected graphs
From MaRDI portal
Publication:730486
DOI10.1016/J.DAM.2016.11.002zbMath1352.05098OpenAlexW2559799404MaRDI QIDQ730486
Lutz Volkmann, Zhibing Chen, Guifu Su
Publication date: 28 December 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.11.002
Related Items (7)
Super edge-connectivity and zeroth-order general Randić index for \(-1 \leq \alpha < 0\) ⋮ The extremal graphs of some topological indices with given vertex \(k\)-partiteness ⋮ Super edge-connectivity and zeroth-order Randić index ⋮ On the zeroth-order general Randić index, variable sum exdeg index and trees having vertices with prescribed degree ⋮ Upper bound on the sum of powers of the degrees of graphs with few crossings per edge ⋮ Super-edge-connectivity and zeroth-order Randić index ⋮ \(M\)-polynomial revisited: Bethe cacti and an extension of Gutman's approach
Uses Software
Cites Work
- Connected \((n,m)\)-graphs with minimum and maximum zeroth-order general Randić index
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- On sharp bounds of the zero-order Randić index of certain unicyclic graphs
- Inverse degree and edge-connectivity
- Degree sequence conditions for maximally edge-connected graphs depending on the clique number
- Maximally edge-connected graphs and zeroth-order general Randić index for \(0<\alpha <1\)
- Extremal \((n,n + 1)\)-graphs with respected to zeroth-order general Randić index
- Diameter and inverse degree
- 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
- Unnamed Item
- Unnamed Item
This page was built for publication: Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected graphs
