Publication:
Matching number and characteristic polynomial of a graph

dc.contributor.authorYurttaş Güneş, Aysun
dc.contributor.authorDemirci, Musa
dc.contributor.authorÖz, Mert Sinan
dc.contributor.authorCangül, İsmail Naci
dc.contributor.buuauthorYURTTAŞ GÜNEŞ, AYSUN
dc.contributor.buuauthorDEMİRCİ, MUSA
dc.contributor.buuauthorCANGÜL, İSMAİL NACİ
dc.contributor.departmentBursa Uludağ Üniversitesi/Fen-Edebiyat Fakültesi/Matematik Bölümü.
dc.contributor.orcid0000-0002-0700-5774
dc.contributor.orcid0000-0002-6439-8439
dc.contributor.researcheridAAG-8470-2021
dc.contributor.researcheridA-6557-2018
dc.contributor.researcheridJ-3505-2017
dc.date.accessioned2024-07-04T06:08:49Z
dc.date.available2024-07-04T06:08:49Z
dc.date.issued2020-07-11
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.
dc.identifier.doi10.1080/16583655.2020.1796275
dc.identifier.endpage999
dc.identifier.issn1658-3655
dc.identifier.issue1
dc.identifier.startpage993
dc.identifier.urihttps://doi.org/10.1080/16583655.2020.1796275
dc.identifier.urihttps://www.tandfonline.com/doi/full/10.1080/16583655.2020.1796275
dc.identifier.urihttps://hdl.handle.net/11452/42853
dc.identifier.volume14
dc.identifier.wos000552843200001
dc.indexed.wosWOS.SCI
dc.language.isoen
dc.publisherTaylor & Francis
dc.relation.journalJournal of Taibah University for Science
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi
dc.rightsinfo:eu-repo/semantics/openAccess
dc.subjectMatching number
dc.subjectCharacteristic polynomial
dc.subjectNullity
dc.subjectScience & technology - other topics
dc.titleMatching number and characteristic polynomial of a graph
dc.typeArticle
dspace.entity.typePublication
relation.isAuthorOfPublicatione2d46f0d-e1af-46a1-8816-bd2c471b2a3d
relation.isAuthorOfPublication939e5708-c157-458f-9a96-64c516b838b5
relation.isAuthorOfPublication601ef81f-9bdf-4a4a-9ac1-82a82260384d
relation.isAuthorOfPublication.latestForDiscoverye2d46f0d-e1af-46a1-8816-bd2c471b2a3d

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Gunes_vd_2020.pdf
Size:
1.7 MB
Format:
Adobe Portable Document Format

Collections