Super edge-connectivity and zeroth-order general Randić index for \(-1 \leq \alpha < 0\)
From MaRDI portal
Publication:1617001
DOI10.1007/s10255-018-0775-5zbMath1400.05136OpenAlexW2895426067MaRDI QIDQ1617001
Publication date: 7 November 2018
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-018-0775-5
Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Connectivity (05C40)
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
- Unnamed Item
This page was built for publication: Super edge-connectivity and zeroth-order general Randić index for \(-1 \leq \alpha < 0\)
