Bounds for matching number of fundamental realizations according to new graph invariant omega

dc.authorid0000-0002-6206-0362en_US
dc.contributor.authorÖz, Mert Sinan
dc.contributor.authorCangul, I.N.
dc.date.accessioned2021-03-20T20:26:53Z
dc.date.available2021-03-20T20:26:53Z
dc.date.issued2020
dc.departmentBTÜ, Mühendislik ve Doğa Bilimleri Fakültesi, Matematik Bölümüen_US
dc.description.abstractMatching number of a graph is one of the intensively studied areas in graph theory due to numerous applications of the matching and related notions. Recently, Delen and Cangul defined a new graph invariant denoted by ? which helps to determine several graph theoretical and combinatorial properties of the realizations of a given degree sequence. In this paper, using K2 deletion process, the maximum and minimum matching numbers of all so-called fundamental realizations of a given degree sequence. © 2020 Jangjeon Research Institute for Mathematical Sciences and Physics. All rights reserved.en_US
dc.identifier.doi10.17777/pjms2020.23.1.23en_US
dc.identifier.endpage37en_US
dc.identifier.issn1598-7264
dc.identifier.issue1en_US
dc.identifier.scopus2-s2.0-85079737325en_US
dc.identifier.scopusqualityQ3en_US
dc.identifier.startpage23en_US
dc.identifier.urihttp://doi.org/10.17777/pjms2020.23.1.23
dc.identifier.urihttps://hdl.handle.net/20.500.12885/1320
dc.identifier.volume23en_US
dc.indekslendigikaynakScopusen_US
dc.institutionauthorÖz, Mert Sinan
dc.language.isoenen_US
dc.publisherJangjeon Research Institute for Mathematical Sciences and Physicsen_US
dc.relation.ispartofProceedings of the Jangjeon Mathematical Societyen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectAcyclic graphen_US
dc.subjectConnectednessen_US
dc.subjectCyclic graphen_US
dc.subjectDegree sequenceen_US
dc.subjectGraph characteristicen_US
dc.subjectMatching numberen_US
dc.subjectOmega invarianten_US
dc.titleBounds for matching number of fundamental realizations according to new graph invariant omegaen_US
dc.typeArticleen_US

Dosyalar