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

Thumbnail Image

Date

2020

Authors


Journal Title

Journal ISSN

Volume Title

Publisher

Jangjeon Research Institute for Mathematical Sciences and Physics

Access Rights

info:eu-repo/semantics/closedAccess

DOI

10.17777/pjms2020.23.1.23

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.

Description

Keywords

Acyclic graph , Connectedness , Cyclic graph , Degree sequence , Graph characteristic , Matching number , Omega invariant

Journal or Series

Proceedings of the Jangjeon Mathematical Society

WoS Q Value

Scopus Q Value

Q3

Volume

23

Issue

1

Citation

URI

http://doi.org/10.17777/pjms2020.23.1.23
 https://hdl.handle.net/20.500.12885/1320

Collections

Scopus İndeksli Yayınlar Koleksiyonu
Matematik Bölümü Yayın Koleksiyonu

Endorsement

Review

Supplemented By

Referenced By

Rights and licensing

info:eu-repo/semantics/closedAccess