Answers are grounded in this paper and cite their sources.
In this article, we study eigenvalues λ λ and their associated eigenvectors x x of the adjacency matrices A A of balanced signed graphs. Balanced signed graphs were first introduced and studied by Harary to handle a problem in social psychology. Harary showed in 1953 that a signed graph is balanced if and only if its vertex set V V can be divided into two sets (either of which may be empty), X X and Y Y , so that each edge between the sets is negative and each within a set is positive. Based on this fundamental theorem for the balanced signed graphs, vertices of a balanced signed graph can be labeled in a way so that its adjacency matrix is well structured. Using this special structure, we find algebraically all eigenvalues and their associated eigenvectors of the adjacency matrix A A of a given balanced signed graph. We present in this study eigenpairs ( λ , x ) (λ ,x) of adjacency matrices of balanced signed graphs with some special structures.
No takes yet. Share an insight, caveat, or question.
Meiqin Chen (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: