Basit öğe kaydını göster

dc.contributor.authorShalom, Mordechaien_US
dc.date.accessioned2022-10-07T19:50:06Z
dc.date.available2022-10-07T19:50:06Z
dc.date.issued2022-08-30
dc.identifier.citationShalom, 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.1058501en_US
dc.identifier.issn2636-8692en_US
dc.identifier.urihttps://hdl.handle.net/11729/4981
dc.identifier.urihttp://dx.doi.org/10.33187/jmsm.1058501
dc.identifier.urihttps://search.trdizin.gov.tr/yayin/detay/1118195
dc.description.abstractBlair 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.language.isoenen_US
dc.publisherMahmut Akyiğiten_US
dc.relation.ispartofJournal of mathematical sciences and modelling (Online)en_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectChordal graphsen_US
dc.subjectEdge-extremal graphsen_US
dc.subjectMatching numberen_US
dc.titleA short proof of the size of edge-extremal chordal graphsen_US
dc.typeArticleen_US
dc.description.versionPublisher's Versionen_US
dc.departmentIşık Üniversitesi, Mühendislik ve Doğa Bilimleri Fakültesi, Bilgisayar Mühendisliği Bölümüen_US
dc.departmentIşık University, Faculty of Engineering and Natural Sciences, Department of Computer Engineeringen_US
dc.authorid0000-0002-2688-5703
dc.authorid0000-0002-2688-5703en_US
dc.identifier.volume5
dc.identifier.issue2
dc.identifier.startpage63
dc.identifier.endpage66
dc.peerreviewedYesen_US
dc.publicationstatusPublisheden_US
dc.relation.publicationcategoryMakale - Ulusal Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.institutionauthorShalom, Mordechaien_US
dc.indekslendigikaynakTR-Dizinen_US


Bu öğenin dosyaları:

Thumbnail

Bu öğe aşağıdaki koleksiyon(lar)da görünmektedir.

Basit öğe kaydını göster