Eigenpairs of adjacency matrices of balanced signed graphs

DOI10.1515/SPMA-2024-0007MaRDI QIDQ6590688zbMATH OpenFDO

Authors Meiqin Chen

Publication date 21 August 2024

Published in Special Matrices (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1515/SPMA-2024-0007

zbMATH Keywords

balanced signed graphseigenvalues and eigenvectorssigned graphstructured adjacency matrix

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Review text

The author studies the eigenvalues and their associated eigenvectors of the adjacency matrices of balanced signed completed graphs and some balanced signed noncompleted graphs. Some properties of balanced signed graphs discussed in this study are known or can be obtained from some results in the graph theory.

Recommendations

• The signed graphs with two eigenvalues unequal to \(\pm 1\)
• On signed graphs with at most two eigenvalues unequal to \(\pm 1\)
• The signed graphs with all but at most three eigenvalues equal to \(-1\)
• On the eigenvalues of signed complete graphs
• Open problems in the spectral theory of signed graphs

Cites work

• A dynamic survey of graph labeling
• A note on the eigenvalue free intervals of some classes of signed threshold graphs
• A surprising property of the least eigenvalue of a graph
• An introduction to the theory of graph spectra
• Equiangular lines with a fixed angle
• scientific article; zbMATH DE number 740754 (Why is no real title available?)
• scientific article; zbMATH DE number 5242079 (Why is no real title available?)
• Induced subgraphs of hypercubes and a proof of the sensitivity conjecture
• Inertias of Laplacian matrices of weighted signed graphs
• Integral regular net-balanced signed graphs with vertex degree at most four
• Matrices in the theory of signed simple graphs
• Matrix Analysis
• Networks, crowds and markets. Reasoning about a highly connected world.
• On the notion of balance of a signed graph
• Signed distance in signed graphs
• Spectral criterion for cycle balance in networks
• Spherical two-distance sets and eigenvalues of signed graphs
• Star complements for \(\pm 2\) in signed graphs
• Walks and eigenvalues of signed graphs

This page was built for publication: Eigenpairs of adjacency matrices of balanced signed graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6590688)