Some signed graphs whose eigenvalues are main
Combinatorics
2021-08-23 v3
Abstract
Let be a graph. For a subset of , the switching of is the signed graph obtained from by reversing the signs of all edges between and . Let be the adjacency matrix of . An eigenvalue of is called a main eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. Let be the graph obtained from the complete graph by attaching pendent edges at some vertex of . In this paper we prove that there exists a switching such that all eigenvalues of are main when is a complete multipartite graph, or is a harmonic tree, or is . These results partly confirm a conjecture of Akbari et al.
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}
}