A signed graph is a pair (G,sigma), where G is a graph and sigma is the sign function on the edges of G. For a signed graph we consider the Laplacian matrix defined as L=D-A, where D is the matrix of vertex degrees of G and A the (signed) adjacency matrix . A signed ∞-graph consists of two signed cycles with just one vertex in common. In this paper, we study the Laplacian spectral determination problem for the class of signed ∞-graphs, and we identify all connected L-cospectral mates.
Connected signed graphs L-cospectral to signed ∞-graphs / Belardo, Francesco; Brunetti, Maurizio. - In: LINEAR & MULTILINEAR ALGEBRA. - ISSN 0308-1087. - 67:(2019), pp. 2410-2426. [10.1080/03081087.2018.1494122]
Connected signed graphs L-cospectral to signed ∞-graphs
Belardo, Francesco;Brunetti, Maurizio
2019
Abstract
A signed graph is a pair (G,sigma), where G is a graph and sigma is the sign function on the edges of G. For a signed graph we consider the Laplacian matrix defined as L=D-A, where D is the matrix of vertex degrees of G and A the (signed) adjacency matrix . A signed ∞-graph consists of two signed cycles with just one vertex in common. In this paper, we study the Laplacian spectral determination problem for the class of signed ∞-graphs, and we identify all connected L-cospectral mates.| File | Dimensione | Formato | |
|---|---|---|---|
|
Connected signed graphs L cospectral to signed graphs.pdf
non disponibili
Descrizione: Articolo in Post-print versione Editore
Tipologia:
Documento in Post-print
Licenza:
Accesso privato/ristretto
Dimensione
1.51 MB
Formato
Adobe PDF
|
1.51 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
