ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Edge connectivity vs vertex connectivity in chordal graphs

Chandran, LS (2001) Edge connectivity vs vertex connectivity in chordal graphs. In: of 7th Annual International Computing and Combinatorics Conference (COCOON'01), 20-23 Aug. 2001, Guilin, China, pp. 384-389.

Full text not available from this repository. (Request a copy)


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)

Item Type: Conference Paper
Publisher: Springer-Verlag
Additional Information: The copyright belongs to Springer-Verlag
Keywords: edge connectivity;vertex connectivity;chordal graphs;minimum degree
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 07 Aug 2007
Last Modified: 27 Aug 2008 12:44
URI: http://eprints.iisc.ac.in/id/eprint/10435

Actions (login required)

View Item View Item