Some relations between the largest eigenvalue and the frustration index of a signed graph
A signed cactus $\dot{G}$ is a connected signed graph such that every edge belongs to at most one cycle. The rank of $\dot{G}$ is the rank of its adjacency matrix. In this paper we prove that $$\sum_{i=1}^k n_i-2k\leq \rank(\dot{G})\leq \sum_{i=1}^k n_i-2t +2 s,$$ where $k$ is the number of cycle...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
American Journal of Combinatorics
2022-12-01
|
| Series: | The American Journal of Combinatorics |
| Subjects: | |
| Online Access: | https://ajcombinatorics.org/Volume1/V1.05.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|