Maximally edge-connected graphs and zeroth-order general Randić index for \(0<\alpha <1\)

DOI10.1016/J.DAM.2013.11.016zbMath1284.05154OpenAlexW2084944172MaRDI QIDQ2440121

Guifu Su, Xiaofeng Su, Limning Xiong

Publication date: 27 March 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.11.016

zbMATH Keywords

edge-connectivitymaximally edge-connectedzeroth-order general Randić indexvertex degree

Mathematics Subject Classification ID

Connectivity (05C40) Vertex degrees (05C07)

Related Items (7)

Unnamed Item ⋮ On the zeroth-order general Randić index, variable sum exdeg index and trees having vertices with prescribed degree ⋮ Graphs with fixed number of pendent vertices and minimal zeroth-order general Randić index ⋮ The weighted version of the handshaking lemma with an application ⋮ Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected graphs ⋮ The zeroth-order general Randic index of graphs with a given clique number ⋮ Maximally and super connected multisplit graphs and digraphs

Uses Software

• GRAFFITI

Cites Work

• On sharp bounds of the zero-order Randić index of certain unicyclic graphs
• Inverse degree and edge-connectivity
• Sufficient conditions for maximally connected dense graphs
• On graphs with equal edge-connectivity and minimum degree
• A sufficient condition for equality of arc-connectivity and minimum degree of a digraph
• Results on the edge-connectivity of graphs
• Bipartite graphs and digraphs with maximum connectivity
• Diameter and inverse degree
• Maximally connected digraphs
• The connectivity of large digraphs and graphs
• A Graph-Theoretic Approach to a Communications Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Maximally edge-connected graphs and zeroth-order general Randić index for \(0<\alpha <1\)