Vertex connectivity of chordal graphs
Combinatorics
2025-02-12 v1
Abstract
Let be a finite graph and the vertex connectivity of . A chordal graph is called chordal if no vertex of is adjacent to all other vertices of . Using the syzygy theory in commutative algebra, it is proved that every chordal graph on vertices satisfies . Furthermore, given an integer , a chordal graph on vertices satisfying is constructed.
Cite
@article{arxiv.2502.07320,
title = {Vertex connectivity of chordal graphs},
author = {Tài Huy Hà and Takayuki Hibi},
journal= {arXiv preprint arXiv:2502.07320},
year = {2025}
}
Comments
4 pages, 1 figure