Öz, Mert SinanCangul, I.N.2021-03-202021-03-2020201598-7264http://doi.org/10.17777/pjms2020.23.1.23https://hdl.handle.net/20.500.12885/1320Matching 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.eninfo:eu-repo/semantics/closedAccessAcyclic graphConnectednessCyclic graphDegree sequenceGraph characteristicMatching numberOmega invariantArticle10.17777/pjms2020.23.1.2323123372-s2.0-85079737325Q3