article

Sufficient degree conditions for k-edge-connectedness of a graph

Authors:

D. Bauer,

S. L. Hakimi,

N. Kahl,

E. SchmeichelAuthors Info & Claims

Networks, Volume 54, Issue 2

Pages 95 - 98

Published: 01 September 2009 Publication History

Abstract

One of Frank Boesch's best known papers is ‘The strongest monotone degree condition for n-connectedness of a graph’ (Boesch, J Combinatorial Theory Ser B 16 (1974), 162–165.). In this article, we give a simple sufficient degree condition for a graph to be k-edge-connected, and also give the strongest monotone condition for a graph to be 2-edge-connected. © 2009 Wiley Periodicals, Inc. NETWORKS, 2009

Regretfully, Lou Hakimi died on June 23, 2006. He was a longtime associate editor of Networks, and a good friend of Professor Boesch.

Cited By

View all

Liu XMeng JTian Y(2023)On forcibly k-edge-connected and forcibly super edge-connected uniform hypergraphic sequencesThe Journal of Supercomputing10.1007/s11227-023-05287-z79:14(15980-15996)Online publication date: 23-Apr-2023
https://dl.acm.org/doi/10.1007/s11227-023-05287-z
Bauer DNevo ASchmeichel EWoodall DYatauro M(2015)Best monotone degree conditions for binding number and cycle structureDiscrete Applied Mathematics10.1016/j.dam.2013.12.014195:C(8-17)Online publication date: 20-Nov-2015
https://dl.acm.org/doi/10.1016/j.dam.2013.12.014
Bauer DBroersma HHeuvel JKahl NNevo ASchmeichel EWoodall DYatauro M(2015)Best Monotone Degree Conditions for Graph PropertiesGraphs and Combinatorics10.1007/s00373-014-1465-631:1(1-22)Online publication date: 1-Jan-2015
https://dl.acm.org/doi/10.1007/s00373-014-1465-6

Sufficient degree conditions for k-edge-connectedness of a graph
1. Mathematics of computing
  1. Discrete mathematics

Recommendations

Sufficient conditions for λ′-optimality in graphs with girth g

For a connected graph the restricted edge-connectivity λ2(G) is defined as the minimum cardinality of an edge-cut over all edge-cuts S such that there are no isolated vertices in GS. A graph G is said to be λ2-optimal if λ2(G) = ξ(G), where ξ(G) is the ...
Sufficient conditions for graphs to be λ′-optimal, super-edge-connected, and maximally edge-connected

The restricted-edge-connectivity of a graph G, denoted by λ′(G), is defined as the minimum cardinality over all edge-cuts S of G, where G-S contains no isolated vertices. The graph G is called λ′-optimal, if λ′(G) = ξ(G), where ξ(G) is the minimum edge-...
Sufficient conditions on the zeroth-order general Randi index for maximally edge-connected graphs

Let G be a connected graph with vertex set V, minimum degree and edge-connectivity . If is a real number, then the zeroth-order general Randi index is defined by xVdeg(x), where deg(x) denotes the degree of the vertex x. A graph is maximally edge-...

Comments

Information & Contributors

Information

Published In

Networks Volume 54, Issue 2

September 2009

48 pages

ISSN:0028-3045

EISSN:1097-0037

Issue’s Table of Contents

Publisher

Wiley-Interscience

United States

Publication History

Published: 01 September 2009

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 19 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Liu XMeng JTian Y(2023)On forcibly k-edge-connected and forcibly super edge-connected uniform hypergraphic sequencesThe Journal of Supercomputing10.1007/s11227-023-05287-z79:14(15980-15996)Online publication date: 23-Apr-2023
https://dl.acm.org/doi/10.1007/s11227-023-05287-z
Bauer DNevo ASchmeichel EWoodall DYatauro M(2015)Best monotone degree conditions for binding number and cycle structureDiscrete Applied Mathematics10.1016/j.dam.2013.12.014195:C(8-17)Online publication date: 20-Nov-2015
https://dl.acm.org/doi/10.1016/j.dam.2013.12.014
Bauer DBroersma HHeuvel JKahl NNevo ASchmeichel EWoodall DYatauro M(2015)Best Monotone Degree Conditions for Graph PropertiesGraphs and Combinatorics10.1007/s00373-014-1465-631:1(1-22)Online publication date: 1-Jan-2015
https://dl.acm.org/doi/10.1007/s00373-014-1465-6

Abstract

Cited By

Recommendations

Sufficient conditions for λ′-optimality in graphs with girth g

Sufficient conditions for graphs to be λ′-optimal, super-edge-connected, and maximally edge-connected

Sufficient conditions on the zeroth-order general Randi index for maximally edge-connected graphs

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations