Maximally edge-connected graphs and Zeroth-order general Randić index for 0

Authors:
Guifu Su;Liming Xiong;Xiaofeng Su
Affiliations:
-;-;-
Venue:
Discrete Applied Mathematics
Year:
2014

Citing 6
Cited 0

Sufficient conditions for maximally connected dense graphs

Discrete Mathematics
The connectivity of large digraphs and graphs

Journal of Graph Theory
A sufficient condition for equality of arc-connectivity and minimum degree of a digraph

Discrete Mathematics
Bipartite graphs and digraphs with maximum connectivity

Discrete Applied Mathematics
Degree sequence conditions for maximally edge-connected graphs and digraphs

Journal of Graph Theory
Graph Theory With Applications

Graph Theory With Applications

Quantified Score

Hi-index	0.04

Visualization

Abstract

Let G be a connected graph with order n=|V(G)|, minimum degree @d=@d(G) and edge-connectivity @l=@l(G). A graph is said to be maximally edge-connected if @l=@d. In this paper, we present two sufficient conditions for (triangle-free) graphs to be maximally edge-connected in terms of its order and the Zeroth-order general Randic index.