Edge Connectivity vs Vertex Connectivity in Chordal Graphs

  • Authors:

  • L. Sunil Chandran

  • Affiliations:

  • -

  • Venue:
  • COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

It is well known that in a graph, ϰ(G) ≤ λ(G) ≤ δ(G), where ϰ(G), λ(G) and δ(G) denote the vertex connectivity, edge connectivity and the minimum degree of G, respectively. We show that in chordal graphs, if λ(G) ≠ δ(G), then λ(G) ≥ 2ϰ(G) - 1. In contrast, in a general graph λ(G) can be equal to ϰ(G).