Let ˙G = (G, σ) be a signed graph, and let ρ( ˙G ) (resp. λ1( ˙G )) denote the spectral radius (resp. the index) of the adjacency matrix A( ˙G) . In this paper we detect the signed graphs achieving the minimum spectral radius m(SRn), the maximum spectral radius M(SRn), the minimum index m(In) and the maximum index M(In) in the set U_n of all unbalanced connected signed graphs with n ≥ 3 vertices. From the explicit computation of the four extremal values it turns out that the difference m(SRn)−m(In) for n ≥ 8 strictly increases with n and tends to 1, whereas M(SRn) − M(In) strictly decreases and tends to 0.
Unbalanced signed graphs with extremal spectral radius or index / Brunetti, M; Stanic, Z. - In: COMPUTATIONAL AND APPLIED MATHEMATICS. - ISSN 0101-8205. - 41:3(2022). [10.1007/s40314-022-01814-5]
Unbalanced signed graphs with extremal spectral radius or index
Brunetti M
;
2022
Abstract
Let ˙G = (G, σ) be a signed graph, and let ρ( ˙G ) (resp. λ1( ˙G )) denote the spectral radius (resp. the index) of the adjacency matrix A( ˙G) . In this paper we detect the signed graphs achieving the minimum spectral radius m(SRn), the maximum spectral radius M(SRn), the minimum index m(In) and the maximum index M(In) in the set U_n of all unbalanced connected signed graphs with n ≥ 3 vertices. From the explicit computation of the four extremal values it turns out that the difference m(SRn)−m(In) for n ≥ 8 strictly increases with n and tends to 1, whereas M(SRn) − M(In) strictly decreases and tends to 0.File | Dimensione | Formato | |
---|---|---|---|
COAM_Brunetti_Stanic.pdf
accesso aperto
Descrizione: Articolo principale
Tipologia:
Documento in Post-print
Licenza:
Dominio pubblico
Dimensione
413.04 kB
Formato
Adobe PDF
|
413.04 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.