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

Guifu Su; Liming Xiong; Xiaofeng Su

doi:10.1016/j.dam.2013.11.016

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

Guifu Su^*, Liming Xiong, Xiaofeng Su

^*Corresponding author for this work

School of Mathematics and Statistics

Research output: Contribution to journal › Article › peer-review

12 Citations (Scopus)

Abstract

Let G be a connected graph with order n=|V(G)|, minimum degree δ=δ(G) and edge-connectivity λ=λ(G). A graph is said to be maximally edge-connected if λ=δ. 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 Randić index.

Original language	English
Pages (from-to)	261-268
Number of pages	8
Journal	Discrete Applied Mathematics
Volume	167
DOIs	https://doi.org/10.1016/j.dam.2013.11.016
Publication status	Published - 20 Apr 2014

Keywords

Degree (of vertex)
Edge-connectivity
Maximally edge-connected
Zeroth-order general Randić index

Access to Document

10.1016/j.dam.2013.11.016

Cite this

Su, G., Xiong, L., & Su, X. (2014). Maximally edge-connected graphs and Zeroth-order general Randić index for 0 < α < 1. Discrete Applied Mathematics, 167, 261-268. https://doi.org/10.1016/j.dam.2013.11.016

@article{73f0b7f0fcd448ceb4914bcdbd32990d,

title = "Maximally edge-connected graphs and Zeroth-order general Randi{\'c} index for 0 < α < 1",

abstract = "Let G be a connected graph with order n=|V(G)|, minimum degree δ=δ(G) and edge-connectivity λ=λ(G). A graph is said to be maximally edge-connected if λ=δ. 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 Randi{\'c} index.",

keywords = "Degree (of vertex), Edge-connectivity, Maximally edge-connected, Zeroth-order general Randi{\'c} index",

author = "Guifu Su and Liming Xiong and Xiaofeng Su",

year = "2014",

month = apr,

day = "20",

doi = "10.1016/j.dam.2013.11.016",

language = "English",

volume = "167",

pages = "261--268",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Maximally edge-connected graphs and Zeroth-order general Randić index for 0 < α < 1

AU - Su, Guifu

AU - Xiong, Liming

AU - Su, Xiaofeng

PY - 2014/4/20

Y1 - 2014/4/20

N2 - Let G be a connected graph with order n=|V(G)|, minimum degree δ=δ(G) and edge-connectivity λ=λ(G). A graph is said to be maximally edge-connected if λ=δ. 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 Randić index.

AB - Let G be a connected graph with order n=|V(G)|, minimum degree δ=δ(G) and edge-connectivity λ=λ(G). A graph is said to be maximally edge-connected if λ=δ. 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 Randić index.

KW - Degree (of vertex)

KW - Edge-connectivity

KW - Maximally edge-connected

KW - Zeroth-order general Randić index

UR - http://www.scopus.com/inward/record.url?scp=84894500062&partnerID=8YFLogxK

U2 - 10.1016/j.dam.2013.11.016

DO - 10.1016/j.dam.2013.11.016

M3 - Article

AN - SCOPUS:84894500062

SN - 0166-218X

VL - 167

SP - 261

EP - 268

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this