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/732
DC FieldValueLanguage
dc.contributor.authorStanić, Zoranen_US
dc.date.accessioned2022-08-15T15:00:12Z-
dc.date.available2022-08-15T15:00:12Z-
dc.date.issued2021-01-01-
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/732-
dc.description.abstractWe derive an inequality that includes the largest eigenvalue of the adjacency matrix and walks of an arbitrary length of a signed graph. We also consider certain particular cases.en
dc.relation.ispartofSpecial Matricesen
dc.subjectadjacency matrixen
dc.subjectindexen
dc.subjectSigned graphen
dc.subjectupper bounden
dc.subjectwalken
dc.titleA note on a walk-based inequality for the index of a signed graphen_US
dc.typeArticleen_US
dc.identifier.doi10.1515/spma-2020-0120-
dc.identifier.scopus2-s2.0-85100288610-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/85100288610-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.description.rankM51en_US
dc.relation.firstpage19en
dc.relation.lastpage21en
dc.relation.volume9en
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

2
checked on Nov 8, 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.