1. Research with MATF
  2. MATF
  3. Research outputs
Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/761
DC FieldValueLanguage
dc.contributor.authorSimić, Slobodan K.en_US
dc.contributor.authorStanić, Zoranen_US
dc.date.accessioned2022-08-15T15:00:15Z-
dc.date.available2022-08-15T15:00:15Z-
dc.date.issued2009-07-01-
dc.identifier.issn08981221en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/761-
dc.description.abstractWe consider the class of graphs whose each component is either a proper subgraph of some Smith graphs, or belongs to a precized subset of Smith graphs. We classify the graphs from the considered class into those which are determined, or not determined, by Laplacian, or signless Laplacian spectrum. © 2009 Elsevier Ltd. All rights reserved.en
dc.relation.ispartofComputers and Mathematics with Applicationsen
dc.subject(signless) Laplacian spectrumen
dc.subjectCospectral graphsen
dc.subjectSmith graphsen
dc.subjectSpectral determinationen
dc.subjectThe largest eigenvaluesen
dc.titleOn some forests determined by their Laplacian or signless Laplacian spectrumen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.camwa.2009.04.005-
dc.identifier.scopus2-s2.0-65749119954-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/65749119954-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.firstpage171en
dc.relation.lastpage178en
dc.relation.volume58en
dc.relation.issue1en
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

15
checked on Nov 9, 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.