Maximal distance spectral radius of 4-chromatic planar graphs

dc.contributor.authorErey, Aysel
dc.date.accessioned2025-10-29T11:26:01Z
dc.date.issued2021
dc.departmentFakülteler, Temel Bilimler Fakültesi, Matematik Bölümü
dc.description.abstractWe show that the kite graph K-4((n)) uniquely maximizes the distance spectral radius among all connected 4-chromatic planar graphs on nvertices. (C) 2021 Elsevier Inc. All rights reserved.
dc.identifier.doi10.1016/j.laa.2021.02.005
dc.identifier.endpage202
dc.identifier.issn0024-3795
dc.identifier.issn1873-1856
dc.identifier.scopus2-s2.0-85100693426
dc.identifier.scopusqualityQ1
dc.identifier.startpage183
dc.identifier.urihttps://doi.org/10.1016/j.laa.2021.02.005
dc.identifier.urihttps://hdl.handle.net/20.500.14854/10061
dc.identifier.volume618
dc.identifier.wosWOS:000630009900012
dc.identifier.wosqualityQ2
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.institutionauthorErey, Aysel
dc.language.isoen
dc.publisherElsevier Science Inc
dc.relation.ispartofLinear Algebra and Its Applications
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/openAccess
dc.snmzKA_WOS_20251020
dc.subjectChromatic number
dc.subjectPlanar graphs
dc.subjectDistance spectral radius
dc.titleMaximal distance spectral radius of 4-chromatic planar graphs
dc.typeArticle

Dosyalar