DC FieldValueLanguage
dc.contributor.authorCvetković, Dragošen
dc.contributor.authorSimić, Slobodanen
dc.contributor.authorStanić, Zoranen
dc.date.accessioned2020-05-01T20:12:49Z-
dc.date.available2020-05-01T20:12:49Z-
dc.date.issued2010-06-01en
dc.identifier.issn0898-1221en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1148-
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.en
dc.publisherElsevier-
dc.relationSerbian Ministry of Science, Projects 144015D and 144032D-
dc.relation.ispartofComputers and Mathematics with Applicationsen
dc.subjectCycles | Graph eigenvalues | Paths | Spectral determinationen
dc.titleSpectral determination of graphs whose components are paths and cyclesen
dc.typeArticleen
dc.identifier.doi10.1016/j.camwa.2010.04.021en
dc.identifier.scopus2-s2.0-77953291771en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage3849en
dc.relation.lastpage3857en
dc.relation.issue12en
dc.relation.volume59en
dc.description.rankM21-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.fulltextNo Fulltext-
Show simple item record

SCOPUSTM   
Citations

12
checked on Jan 29, 2023

Page view(s)

8
checked on Jan 30, 2023

Google ScholarTM

Check

Altmetric

Altmetric


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