Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/2927
Title: Strong Regularity of Signed Graphs
Authors: Stanić, Zoran 
Affiliations: Numerical Mathematics and Optimization 
Issue Date: 2025
Rank: M32
Publisher: Buenos Aires : LAGOS 2025
Related Publication(s): XIII Latin American Algorithms, Graphs and Optimization Symposium : Program and abstracts, Buenos Aires, 2025
Conference: Latin American Algorithms, Graphs and Optimization Symposium LAGOS (13 ; 2025 ; Buenos Aires)
Abstract: 
We introduce the concept of strong regularity for signed graphs, which extends the classical notion of strongly regular graphs by incorporating the effects of edge signs into the combinatorial and spectral framework. Within this setting, every strongly regular graph naturally appears as a special case, corresponding to the all-positive signature. Fundamental properties of strongly regular signed graphs are established, together with construction techniques and relationships to spectral features and structural parameters, including net regularity and walk regularity.
URI: https://research.matf.bg.ac.rs/handle/123456789/2927
Appears in Collections:Research outputs

Show full item record

Google ScholarTM

Check


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