On the spectral radius of unbalanced signed bipartite graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929458397577216 |
|---|---|
| author | Conde, Cristian M. Dratman, Ezequiel Grippo, Luciano N. |
| author_facet | Conde, Cristian M. Dratman, Ezequiel Grippo, Luciano N. |
| contents | A signed graph is one that features two types of edges: positive and negative. Balanced signed graphs are those in which all cycles contain an even number of positive edges. In the adjacency matrix of a signed graph, entries can be $0$, $-1$, or $1$, depending on whether $ij$ represents no edge, a negative edge, or a positive edge, respectively. The index of the adjacency matrix of a signed graph $\dot{G}$ is less or equal to the index of the adjacency matrix of its underlying graph $G$, i.e., $λ_1(\dot{G}) \le λ_1(G)$. Indeed, if $\dot{G}$ is balanced, then $λ_1(\dot{G})=λ_1(G)$. This inequality becomes strict when $\dot{G}$ is an unbalanced signed graph. Recently, Brunetti and Stanić found the whole list of unbalanced signed graphs on $n$ vertices with maximum (resp. minimum) spectral radius. To our knowledge, there has been little research on this problem when unbalanced signed graphs are confined to specific graph classes. In this article, we demonstrate that there is only one unbalanced signed bipartite graph on $n$ vertices with maximum spectral radius, up to an operation on the signed edges known as switching. Additionally, we investigate unbalanced signed complete bipartite graphs on $n$ vertices with a bounded number of edges and maximum spectral radius, where the negative edges induce a tree. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_07195 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On the spectral radius of unbalanced signed bipartite graphs Conde, Cristian M. Dratman, Ezequiel Grippo, Luciano N. Combinatorics 05C22, 15A18, G.2.2 A signed graph is one that features two types of edges: positive and negative. Balanced signed graphs are those in which all cycles contain an even number of positive edges. In the adjacency matrix of a signed graph, entries can be $0$, $-1$, or $1$, depending on whether $ij$ represents no edge, a negative edge, or a positive edge, respectively. The index of the adjacency matrix of a signed graph $\dot{G}$ is less or equal to the index of the adjacency matrix of its underlying graph $G$, i.e., $λ_1(\dot{G}) \le λ_1(G)$. Indeed, if $\dot{G}$ is balanced, then $λ_1(\dot{G})=λ_1(G)$. This inequality becomes strict when $\dot{G}$ is an unbalanced signed graph. Recently, Brunetti and Stanić found the whole list of unbalanced signed graphs on $n$ vertices with maximum (resp. minimum) spectral radius. To our knowledge, there has been little research on this problem when unbalanced signed graphs are confined to specific graph classes. In this article, we demonstrate that there is only one unbalanced signed bipartite graph on $n$ vertices with maximum spectral radius, up to an operation on the signed edges known as switching. Additionally, we investigate unbalanced signed complete bipartite graphs on $n$ vertices with a bounded number of edges and maximum spectral radius, where the negative edges induce a tree. |
| title | On the spectral radius of unbalanced signed bipartite graphs |
| topic | Combinatorics 05C22, 15A18, G.2.2 |
| url | https://arxiv.org/abs/2408.07195 |