Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/774
DC FieldValueLanguage
dc.contributor.authorCvetković, Dragošen_US
dc.contributor.authorSimić, Slobodan K.en_US
dc.contributor.authorStanić, Zoranen_US
dc.date.accessioned2022-08-15T15:00:17Z-
dc.date.available2022-08-15T15:00:17Z-
dc.date.issued2010-06-01-
dc.identifier.issn08981221en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/774-
dc.description.abstractWe consider the class of graphs each of whose components is either a path or a cycle. We classify the graphs from the class considered into those which are determined and those which are not determined by the adjacency spectrum. In addition, we compare the result with the corresponding results for the Laplacian and the signless Laplacian spectra. It turns out that the signless Laplacian spectrum performs the best, confirming some expectations from the literature. © 2010 Elsevier Ltd. All rights reserved.en
dc.relation.ispartofComputers and Mathematics with Applicationsen
dc.subjectCyclesen
dc.subjectGraph eigenvaluesen
dc.subjectPathsen
dc.subjectSpectral determinationen
dc.titleSpectral determination of graphs whose components are paths and cyclesen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.camwa.2010.04.021-
dc.identifier.scopus2-s2.0-77953291771-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/77953291771-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.firstpage3849en
dc.relation.lastpage3857en
dc.relation.volume59en
dc.relation.issue12en
item.fulltextNo Fulltext-
item.openairetypeArticle-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
crisitem.author.deptNumerical Mathematics and Optimization-
crisitem.author.orcid0000-0002-4949-4203-
Appears in Collections:Research outputs
Show simple item record

SCOPUSTM   
Citations

12
checked on Nov 10, 2024

Page view(s)

10
checked on Nov 15, 2024

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.