A short proof of the size of edge-extremal chordal graphs
dc.authorid | 0000-0002-2688-5703 | |
dc.authorid | 0000-0002-2688-5703 | en_US |
dc.contributor.author | Shalom, Mordechai | en_US |
dc.date.accessioned | 2022-10-07T19:50:06Z | |
dc.date.available | 2022-10-07T19:50:06Z | |
dc.date.issued | 2022-08-30 | |
dc.department | Işık Üniversitesi, Mühendislik ve Doğa Bilimleri Fakültesi, Bilgisayar Mühendisliği Bölümü | en_US |
dc.department | Işık University, Faculty of Engineering and Natural Sciences, Department of Computer Engineering | en_US |
dc.description.abstract | 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. | en_US |
dc.description.version | Publisher's Version | en_US |
dc.identifier.citation | 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 | en_US |
dc.identifier.endpage | 66 | |
dc.identifier.issn | 2636-8692 | en_US |
dc.identifier.issue | 2 | |
dc.identifier.startpage | 63 | |
dc.identifier.uri | https://hdl.handle.net/11729/4981 | |
dc.identifier.uri | http://dx.doi.org/10.33187/jmsm.1058501 | |
dc.identifier.uri | https://search.trdizin.gov.tr/yayin/detay/1118195 | |
dc.identifier.volume | 5 | |
dc.indekslendigikaynak | TR-Dizin | en_US |
dc.institutionauthor | Shalom, Mordechai | en_US |
dc.language.iso | en | en_US |
dc.peerreviewed | Yes | en_US |
dc.publicationstatus | Published | en_US |
dc.publisher | Mahmut Akyiğit | en_US |
dc.relation.ispartof | Journal of mathematical sciences and modelling (Online) | en_US |
dc.relation.publicationcategory | Makale - Ulusal Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | Chordal graphs | en_US |
dc.subject | Edge-extremal graphs | en_US |
dc.subject | Matching number | en_US |
dc.title | A short proof of the size of edge-extremal chordal graphs | en_US |
dc.type | Article | en_US |
Dosyalar
Orijinal paket
1 - 1 / 1
Yükleniyor...
- İsim:
- A_short_proof_of_the_size_of_edge_extremal_chordal_graphs.pdf
- Boyut:
- 232.17 KB
- Biçim:
- Adobe Portable Document Format
- Açıklama:
- Publisher's Version
Lisans paketi
1 - 1 / 1
Küçük Resim Yok
- İsim:
- license.txt
- Boyut:
- 1.44 KB
- Biçim:
- Item-specific license agreed upon to submission
- Açıklama: