The signed graphs with symmetric spectra
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2023
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866913814207791104 |
|---|---|
| author | Li, Deqiong Huang, Qiongxiang |
| author_facet | Li, Deqiong Huang, Qiongxiang |
| contents | It is well known that a graph $G$ has a symmetric spectrum if and only if it is bipartite, a signed graph $Γ=(G,σ)$ has a symmetric spectrum if $G$ is bipartite. However, there exists a spectrally symmetric signed graph $Γ=(G,σ)$ such that $G$ is not bipartite. In this paper, we focus to characterize the signed graphs with symmetric spectra. Some necessary and (or) sufficient conditions for spectrally symmetric signed graphs are given. Moreover, some methods to construct signed graphs with symmetric spectra are found and infinite families of these signed graphs are produced. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2304_06864 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | The signed graphs with symmetric spectra Li, Deqiong Huang, Qiongxiang Combinatorics It is well known that a graph $G$ has a symmetric spectrum if and only if it is bipartite, a signed graph $Γ=(G,σ)$ has a symmetric spectrum if $G$ is bipartite. However, there exists a spectrally symmetric signed graph $Γ=(G,σ)$ such that $G$ is not bipartite. In this paper, we focus to characterize the signed graphs with symmetric spectra. Some necessary and (or) sufficient conditions for spectrally symmetric signed graphs are given. Moreover, some methods to construct signed graphs with symmetric spectra are found and infinite families of these signed graphs are produced. |
| title | The signed graphs with symmetric spectra |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2304.06864 |