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

DOI10.1007/s10878-014-9728-yzbMath1360.90264OpenAlexW2032154165MaRDI QIDQ5963616

Guifu Su, Guo Jun Li, Limning Xiong, Xiaofeng Su

Publication date: 23 February 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-014-9728-y

zbMATH Keywords

edge-connectivitydegree (of vertex)maximally edge-connectedzeroth-order general Randić index

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (10)

Super edge-connectivity and zeroth-order general Randić index for \(-1 \leq \alpha < 0\) ⋮ Unnamed Item ⋮ 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 ⋮ Beyond the Zagreb indices ⋮ Super-edge-connectivity and zeroth-order Randić index ⋮ Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected graphs ⋮ Zeroth-order general Randić index of cactus 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
• Degree sequence conditions for maximally edge-connected graphs depending on the clique number
• Diameter and inverse degree
• Maximally connected digraphs
• Congruent Graphs and the Connectivity of Graphs
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

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