Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/732| Title: | A note on a walk-based inequality for the index of a signed graph | Authors: | Stanić, Zoran | Affiliations: | Numerical Mathematics and Optimization | Keywords: | adjacency matrix;index;Signed graph;upper bound;walk | Issue Date: | 1-Jan-2021 | Rank: | M51 | Journal: | Special Matrices | Abstract: | We 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. |
URI: | https://research.matf.bg.ac.rs/handle/123456789/732 | DOI: | 10.1515/spma-2020-0120 |
| Appears in Collections: | Research outputs |
Show full item record
SCOPUSTM
Citations
2
checked on Mar 4, 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.