Bounds for matching number of fundamental realizations according to new graph invariant omega
Küçük Resim Yok
Tarih
2020
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Jangjeon Research Institute for Mathematical Sciences and Physics
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
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.
Açıklama
Anahtar Kelimeler
Acyclic graph, Connectedness, Cyclic graph, Degree sequence, Graph characteristic, Matching number, Omega invariant
Kaynak
Proceedings of the Jangjeon Mathematical Society
WoS Q Değeri
Scopus Q Değeri
Q3
Cilt
23
Sayı
1
