On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts

  • L. Sunil Chandran
  • N. S. Narayanaswamy
Conference paper

DOI: 10.1007/978-3-540-27798-9_18

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3106)
Cite this paper as:
Chandran L.S., Narayanaswamy N.S. (2004) On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts. In: Chwa KY., Munro J.I.J. (eds) Computing and Combinatorics. COCOON 2004. Lecture Notes in Computer Science, vol 3106. Springer, Berlin, Heidelberg

Abstract

A cut (A,B) (where B = VA) in a graph G(V,E) is called internal, iff there exists a node x in A which is not adjacent to any node in B and there exists a node yB such that it is not adjacent to any node in A. In this paper, we present a theorem regarding the arrangement of cliques in a chordal graph with respect to its internal cuts. Our main result is that given any internal cut (A,B) in a chordal graph G, there exists a clique with κ(G) + 1 nodes (where κ(G) is the vertex connectivity of G) such that it is (approximately) bisected by the cut (A,B). In fact we give a stronger result: For any internal cut (A,B) of a chordal graph, for each i, 0 ≤ iκ(G) +1, there exists a clique Ki such that |Ki| = κ(G) + 1, |AKi| = i and |BKi| = κ(G) + 1 – i.

An immediate corollary of the above result is that the number of edges in any internal cut (of a chordal graph) should be Ω (k2), where κ(G) = k. Prompted by this observation, we investigate the size of internal cuts in terms of the vertex connectivity of the chordal graphs. As a corollary, we show that in chordal graphs, if the edge connectivity is strictly less than the minimum degree, then the size of the mincut is at least \( \frac{\kappa(G)(\kappa (G)+1)}{2}\), where κ(G) denotes the vertex connectivity. In contrast, in a general graph the size of the mincut can be equal to κ(G). This result is tight.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • L. Sunil Chandran
    • 1
  • N. S. Narayanaswamy
    • 2
  1. 1.Max–Planck Institute for InformatikSaarbrückenGermany
  2. 2.Department of Computer Science and EngineeringIndian Institute of TechnologyChennaiIndia

Personalised recommendations