English

Some signed graphs whose eigenvalues are main

Combinatorics 2021-08-23 v3

Abstract

Let GG be a graph. For a subset XX of V(G)V(G), the switching σ\sigma of GG is the signed graph GσG^{\sigma} obtained from GG by reversing the signs of all edges between XX and V(G)XV(G)\setminus X. Let A(Gσ)A(G^{\sigma}) be the adjacency matrix of GσG^{\sigma}. An eigenvalue of A(Gσ)A(G^{\sigma}) is called a main eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. Let Sn,kS_{n,k} be the graph obtained from the complete graph KnrK_{n-r} by attaching rr pendent edges at some vertex of KnrK_{n-r}. In this paper we prove that there exists a switching σ\sigma such that all eigenvalues of GσG^{\sigma} are main when GG is a complete multipartite graph, or GG is a harmonic tree, or GG is Sn,kS_{n,k}. These results partly confirm a conjecture of Akbari et al.

Keywords

Cite

@article{arxiv.2106.07878,
  title  = {Some signed graphs whose eigenvalues are main},
  author = {Zhenan Shao and Xiying Yuan},
  journal= {arXiv preprint arXiv:2106.07878},
  year   = {2021}
}