Super edge-connectivity and zeroth-order Randić index

DOI10.7151/dmgt.2164zbMath1446.05022OpenAlexW2897928486MaRDI QIDQ2194524

Mei Lu, Zhi-hong He

Publication date: 26 August 2020

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2164

zbMATH Keywords

degreeminimum degreetriangle-free graphsuper edge-connectedzeroth-order Randić index

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Vertex degrees (05C07) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)

Related Items (1)

The (n,k)-Modified-Bubble-Sort Graph: A Generalized Modified-Bubble-Sort Graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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\)

This page was built for publication: Super edge-connectivity and zeroth-order Randić index