Vertex connectivity of chordal graphs

Abstract

Let G be a finite graph and (G) the vertex connectivity of G. A chordal graph G is called chordal* if no vertex of G is adjacent to all other vertices of G. Using the syzygy theory in commutative algebra, it is proved that every chordal* graph G on n vertices satisfies (G) ≤ (n - 1) - 2n-2\,. Furthermore, given an integer 0 ≤ ≤ (n - 1) - 2n-2\,, a chordal* graph G on n vertices satisfying (G) = is constructed.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…