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_US
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.relation.ispartofComputers and Mathematics with Applicationsen_US
dc.subject(signless) Laplacian spectrumen_US
dc.subjectCospectral graphsen_US
dc.subjectSmith graphsen_US
dc.subjectSpectral determinationen_US
dc.subjectThe largest eigenvaluesen_US
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.isi000267143100019-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/65749119954-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.issn0898-1221en_US
dc.description.rankM21en_US
dc.relation.firstpage171en_US
dc.relation.lastpage178en_US
dc.relation.volume58en_US
dc.relation.issue1en_US
item.openairetypeArticle-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextnone-
item.languageiso639-1en-
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 Jun 11, 2025

Page view(s)

12
checked on Jan 19, 2025

Google ScholarTM

Check

Altmetric

Altmetric


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