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

Guifu Su (), Liming Xiong (), Xiaofeng Su () and Guojun Li ()
Additional contact information
Guifu Su: Beijing Institute of Technology
Liming Xiong: Beijing Institute of Technology
Xiaofeng Su: Shanghai Maritime University
Guojun Li: University of Georgia

Journal of Combinatorial Optimization, 2016, vol. 31, issue 1, No 13, 182-195

Abstract: Abstract Let $$G$$ G be a connected graph with order $$n,$$ n , minimum degree $$\delta =\delta (G)$$ δ = δ ( G ) and edge-connectivity $$\lambda =\lambda (G).$$ λ = λ ( G ) . A graph $$G$$ G is maximally edge-connected if $$\lambda =\delta .$$ λ = δ . 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); Zeroth-order general Randić index; Edge-connectivity; Maximally edge-connected (search for similar items in EconPapers)
Date: 2016
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-014-9728-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:31:y:2016:i:1:d:10.1007_s10878-014-9728-y

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-014-9728-y

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().