Matching number and characteristic polynomial of a graph

Basit Öğe Kaydı
dc.authorid0000-0002-6206-0362en_US
dc.contributor.authorYurttas Gunes, Aysun
dc.contributor.authorDemirci, Musa
dc.contributor.authorÖz, Mert Sinan
dc.contributor.authorCangul, Ismail Naci
dc.date.accessioned2021-03-20T20:12:22Z
dc.date.available2021-03-20T20:12:22Z
dc.date.issued2020
dc.departmentBTÜ, Mühendislik ve Doğa Bilimleri Fakültesi, Matematik Bölümüen_US
dc.description.abstractMatching number and the spectral properties depending on the characteristic polynomial of a graph obtained by means of the adjacency polynomial has many interesting applications in different areas of science. There are some work giving the relation of these two areas. Here the relations between these two notions are considered and several general results giving this relations are obtained. A result given for only unicyclic graphs is generalized. There are some methods for determining the matching number of a graph in literature. Usually nullity, spanning trees and several graph parts are used to do this. Here, as a new method, the conditions for calculating the matching number of a graph by means of the coefficients of the characteristic polynomial of the graph are determined. Finally some results on the matching number of graphs are obtained.en_US
dc.identifier.doi10.1080/16583655.2020.1796275en_US
dc.identifier.endpage999en_US
dc.identifier.issn1658-3655
dc.identifier.issue1en_US
dc.identifier.startpage993en_US
dc.identifier.urihttp://doi.org/10.1080/16583655.2020.1796275
dc.identifier.urihttps://hdl.handle.net/20.500.12885/514
dc.identifier.volume14en_US
dc.identifier.wosWOS:000552843200001en_US
dc.identifier.wosqualityQ2en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.institutionauthorÖz, Mert Sinan
dc.language.isoenen_US
dc.publisherTaylor & Francis Ltden_US
dc.relation.ispartofJournal Of Taibah University For Scienceen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectMatching numberen_US
dc.subjectcharacteristic polynomialen_US
dc.subjectnullityen_US
dc.titleMatching number and characteristic polynomial of a graphen_US
dc.typeArticleen_US

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim
İsim:
Yurttas-gunes-2020-Matching-number-and-characteristic-.pdf
Boyut:
1.72 MB
Biçim:
Adobe Portable Document Format
Açıklama:
Tam Metin / Full Text
İndir

Koleksiyon

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