Rank of signed cacti
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 \operatorname{rank}(\dot{G})\leq \sum_{i=1}^k n_i-2t +2 s,\] where \(k\) is t...
| Huvudupphovsman: | |
|---|---|
| Materialtyp: | Artikel |
| Språk: | English |
| Publicerad: |
American Journal of Combinatorics
2023-10-01
|
| Serie: | The American Journal of Combinatorics |
| Ämnen: | |
| Länkar: | https://ajcombinatorics.org/ojs/index.php/AmJC/article/view/13 |