The minimum size of a chordal graph with given order and minimum degree
Xingzhi Zhan, Leilei Zhang
TL;DR
This paper determines the smallest possible number of edges in a chordal graph given its number of vertices and minimum degree, revealing new properties of such graphs.
Contribution
It introduces a method to find the minimum size of chordal graphs with specified order and minimum degree, and uncovers new properties of chordal graphs.
Findings
Identified the minimum number of edges for given order and degree
Discovered new properties of chordal graphs
Provided bounds and structural insights
Abstract
A graph is chordal if it does not contain an induced cycle of length greater than three. We determine the minimum size of a chordal graph with given order and minimum degree. In doing so, we have discovered interesting properties of chordal graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.