The spectral radius of unbalanced signed graphs without negative $C_3$ or $C_4$
Combinatorics
2024-07-24 v1
Abstract
A signed graph is a graph in which every edge carries a or a sign. In this paper, we determine the signed graphs with maximum spectral radius among all unbalanced signed graphs with fixed order that contain neither negative three-cycles nor negative four-cycles.
Cite
@article{arxiv.2407.15898,
title = {The spectral radius of unbalanced signed graphs without negative $C_3$ or $C_4$},
author = {Yiting Cai and Bo Zhou},
journal= {arXiv preprint arXiv:2407.15898},
year = {2024}
}