Loading...
- Type of Document: Article
- DOI: 10.1016/j.laa.2020.04.029
- Publisher: Elsevier Inc , 2020
- Abstract:
- A signed graph Gσ is an ordered pair (V(G),E(G)), where V(G) and E(G) are the set of vertices and edges of G, respectively, along with a map σ that signs every edge of G with +1 or −1. An eigenvalue of the associated adjacency matrix of Gσ, denoted by A(Gσ), is a main eigenvalue if the corresponding eigenspace has a non-orthogonal eigenvector to the all-one vector j. We conjectured that for every graph G≠K2,K4{e}, there is a switching σ such that all eigenvalues of Gσ are main. We show that this conjecture holds for every Cayley graphs, distance-regular graphs, vertex and edge-transitive graphs as well as double stars and paths. © 2020 Elsevier Inc
- Keywords:
- Main eigenvalue ; Signed graph ; Switching graph ; Eigenvalues and eigenfunctions ; Graphic methods ; Adjacency matrices ; Cayley graphs ; Distance regular graph ; Edge-transitive graphs ; Non-orthogonal ; Ordered pairs ; Signed graphs ; Graph theory
- Source: Linear Algebra and Its Applications ; 2020
- URL: https://www.sciencedirect.com/science/article/abs/pii/S0024379520302238#!