Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/715
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Stanić, Zoran | en_US |
dc.date.accessioned | 2022-08-15T15:00:10Z | - |
dc.date.available | 2022-08-15T15:00:10Z | - |
dc.date.issued | 2019-07-15 | - |
dc.identifier.issn | 00243795 | en |
dc.identifier.uri | https://research.matf.bg.ac.rs/handle/123456789/715 | - |
dc.description.abstract | In this study we derive certain upper bounds for the largest eigenvalue (called the index and denoted λ 1 ) of a signed graph. In particular, we prove the following upper bound: λ 12 ≤max{d i m i −n i :1≤i≤n}, where d i is the vertex degree of i, m i =[Formula presented]∑ j∼i d j and n i =∑j∼i(|N iσ(ij) ∩N j |−||N iσ(ij) ∩N jσ(ij) |−|N iσ(ij) ∩N j−σ(ij) ||), with N i ,N i+ and N i− denoting the neighbourhood, the positive neighbourhood and the negative neighbourhood of a vertex i. In our proofs we use standard techniques transferred from the field of (unsigned, simple) graphs. Using the fact that all switching equivalent signed graphs share the same spectrum, we derive some more sophisticated bounds. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Elsevier | en_US |
dc.relation.ispartof | Linear Algebra and Its Applications | en_US |
dc.subject | Adjacency matrix | en_US |
dc.subject | Index | en_US |
dc.subject | Net-regular signed graph | en_US |
dc.subject | Signed graph | en_US |
dc.subject | Switching equivalence | en_US |
dc.subject | Upper bound | en_US |
dc.title | Bounding the largest eigenvalue of signed graphs | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1016/j.laa.2019.03.011 | - |
dc.identifier.scopus | 2-s2.0-85063405891 | - |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/85063405891 | - |
dc.contributor.affiliation | Numerical Mathematics and Optimization | en_US |
dc.relation.issn | 0024-3795 | en_US |
dc.description.rank | M21 | en_US |
dc.relation.firstpage | 80 | en_US |
dc.relation.lastpage | 89 | en_US |
dc.relation.volume | 573 | en_US |
item.grantfulltext | none | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.openairetype | Article | - |
item.languageiso639-1 | en | - |
item.fulltext | No Fulltext | - |
item.cerifentitytype | Publications | - |
crisitem.author.dept | Numerical Mathematics and Optimization | - |
crisitem.author.orcid | 0000-0002-4949-4203 | - |
Appears in Collections: | Research outputs |
SCOPUSTM
Citations
23
checked on Mar 27, 2025
Page view(s)
14
checked on Jan 19, 2025
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.