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

Guifu Su; Liming Xiong; Xiaofeng Su; Guojun Li

doi:10.1007/s10878-014-9728-y

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

Guifu Su^*, Liming Xiong, Xiaofeng Su, Guojun Li

^*Corresponding author for this work

School of Mathematics and Statistics

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

17 Citations (Scopus)

Abstract

Let G be a connected graph with order n, minimum degree δ=δ(G) and edge-connectivity λ=λ(G). A graph G is maximally edge-connected if λ=δ. In this paper, we present two sufficient conditions for graphs to be maximally edge-connected, which generalize two results recently proved by P. Dankelmann, A. Hellwig and L. Volkmann. The extremal graphs are also characterized.

Original language	English
Pages (from-to)	182-195
Number of pages	14
Journal	Journal of Combinatorial Optimization
Volume	31
Issue number	1
DOIs	https://doi.org/10.1007/s10878-014-9728-y
Publication status	Published - 1 Jan 2016

Keywords

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

Access to Document

10.1007/s10878-014-9728-y

Cite this

@article{2d120e66d46f4214a84fee18f691cdaa,

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

abstract = "Let G be a connected graph with order n, minimum degree δ=δ(G) and edge-connectivity λ=λ(G). A graph G is maximally edge-connected if λ=δ. In this paper, we present two sufficient conditions for graphs to be maximally edge-connected, which generalize two results recently proved by P. Dankelmann, A. Hellwig and L. Volkmann. The extremal graphs are also characterized.",

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

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

note = "Publisher Copyright: {\textcopyright} 2014, Springer Science+Business Media New York.",

year = "2016",

month = jan,

day = "1",

doi = "10.1007/s10878-014-9728-y",

language = "English",

volume = "31",

pages = "182--195",

journal = "Journal of Combinatorial Optimization",

issn = "1382-6905",

publisher = "Springer Netherlands",

number = "1",

}

TY - JOUR

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

AU - Su, Guifu

AU - Xiong, Liming

AU - Su, Xiaofeng

AU - Li, Guojun

PY - 2016/1/1

Y1 - 2016/1/1

N2 - Let G be a connected graph with order n, minimum degree δ=δ(G) and edge-connectivity λ=λ(G). A graph G is maximally edge-connected if λ=δ. In this paper, we present two sufficient conditions for graphs to be maximally edge-connected, which generalize two results recently proved by P. Dankelmann, A. Hellwig and L. Volkmann. The extremal graphs are also characterized.

AB - Let G be a connected graph with order n, minimum degree δ=δ(G) and edge-connectivity λ=λ(G). A graph G is maximally edge-connected if λ=δ. In this paper, we present two sufficient conditions for graphs to be maximally edge-connected, which generalize two results recently proved by P. Dankelmann, A. Hellwig and L. Volkmann. The extremal graphs are also characterized.

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=84953635965&partnerID=8YFLogxK

U2 - 10.1007/s10878-014-9728-y

DO - 10.1007/s10878-014-9728-y

M3 - Article

AN - SCOPUS:84953635965

SN - 1382-6905

VL - 31

SP - 182

EP - 195

JO - Journal of Combinatorial Optimization

JF - Journal of Combinatorial Optimization

IS - 1

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this