The minimum size of a chordal graph with given order and minimum degree
arXiv:2409.10261
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.
arXiv comment8 pages