Bounds for matching number of fundamental realizations according to new graph invariant omega
dc.authorid | 0000-0002-6206-0362 | en_US |
dc.contributor.author | Öz, Mert Sinan | |
dc.contributor.author | Cangul, I.N. | |
dc.date.accessioned | 2021-03-20T20:26:53Z | |
dc.date.available | 2021-03-20T20:26:53Z | |
dc.date.issued | 2020 | |
dc.department | BTÜ, Mühendislik ve Doğa Bilimleri Fakültesi, Matematik Bölümü | en_US |
dc.description.abstract | Matching 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.doi | 10.17777/pjms2020.23.1.23 | en_US |
dc.identifier.endpage | 37 | en_US |
dc.identifier.issn | 1598-7264 | |
dc.identifier.issue | 1 | en_US |
dc.identifier.scopus | 2-s2.0-85079737325 | en_US |
dc.identifier.scopusquality | Q3 | en_US |
dc.identifier.startpage | 23 | en_US |
dc.identifier.uri | http://doi.org/10.17777/pjms2020.23.1.23 | |
dc.identifier.uri | https://hdl.handle.net/20.500.12885/1320 | |
dc.identifier.volume | 23 | en_US |
dc.indekslendigikaynak | Scopus | en_US |
dc.institutionauthor | Öz, Mert Sinan | |
dc.language.iso | en | en_US |
dc.publisher | Jangjeon Research Institute for Mathematical Sciences and Physics | en_US |
dc.relation.ispartof | Proceedings of the Jangjeon Mathematical Society | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Acyclic graph | en_US |
dc.subject | Connectedness | en_US |
dc.subject | Cyclic graph | en_US |
dc.subject | Degree sequence | en_US |
dc.subject | Graph characteristic | en_US |
dc.subject | Matching number | en_US |
dc.subject | Omega invariant | en_US |
dc.title | Bounds for matching number of fundamental realizations according to new graph invariant omega | en_US |
dc.type | Article | en_US |