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_US
dc.language.isoenen_US
dc.publisherDe Gruyteren_US
dc.relation.ispartofSpecial Matricesen_US
dc.subjectadjacency matrixen_US
dc.subjectindexen_US
dc.subjectSigned graphen_US
dc.subjectupper bounden_US
dc.subjectwalken_US
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.isi000609468200001-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/85100288610-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.issn2300-7451en_US
dc.relation.firstpage19en_US
dc.relation.lastpage21en_US
dc.relation.volume9en_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

2
checked on Jun 12, 2025

Page view(s)

10
checked on Jan 19, 2025

Google ScholarTM

Check

Altmetric

Altmetric


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