Contents

Ars Combinatoria

  • Research article

On Equality of Restricted Edge Connectivity and Minimum Edge Degree of Graphs

Yingying Qin1, Jianping Ou1, Zhiping Xiong1
1Department of Mathematics, Wuyi University, Jiangmen 529020, China
  • Published: 31/07/2013

Abstract

Restricted edge connectivity is a more refined network reliability index than edge connectivity. It is known that communication networks with larger restricted edge connectivity are more locally reliable.
This work presents a distance condition for graphs to be maximally restricted edge connected, which generalizes Plesník’s corresponding result.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Yingying Qin, Jianping Ou, Zhiping Xiong. On Equality of Restricted Edge Connectivity and Minimum Edge Degree of Graphs[J], Ars Combinatoria, Volume 110. 65-70. .