The minimum size of a chordal graph with given order and minimum degree
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866917776827875328 |
|---|---|
| author | Zhan, Xingzhi Zhang, Leilei |
| author_facet | Zhan, Xingzhi Zhang, Leilei |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_10261 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The minimum size of a chordal graph with given order and minimum degree Zhan, Xingzhi Zhang, Leilei Combinatorics 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. |
| title | The minimum size of a chordal graph with given order and minimum degree |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2409.10261 |