A short proof of the size of edge-extremal chordal graphs
Yükleniyor...
Tarih
2022-08-30
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Mahmut Akyiğit
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
Blair et. al. [3] have recently determined the maximum number of edges of a chordal graph with a maximum degree less than d and the matching number at most ? by exhibiting a family of chordal graphs achieving this bound. We provide simple proof of their result.
Açıklama
Anahtar Kelimeler
Chordal graphs, Edge-extremal graphs, Matching number
Kaynak
Journal of mathematical sciences and modelling (Online)
WoS Q Değeri
Scopus Q Değeri
Cilt
5
Sayı
2
Künye
Shalom, M. (2022). A short proof of the size of edge-extremal chordal graphs. Journal of mathematical sciences and modelling (Online), 5(2), 63-66. doi:10.33187/jmsm.1058501
