Spectral Properties of Dual Unit Gain Graphs
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866916237549764608 |
|---|---|
| author | Cui, Chunfeng Lu, Yong Qi, Liqun Wang, Ligong |
| author_facet | Cui, Chunfeng Lu, Yong Qi, Liqun Wang, Ligong |
| contents | In this paper, we study dual quaternion and dual complex unit gain graphs and their spectral properties in a unified frame of dual unit gain graphs. Unit dual quaternions represent rigid movements in the 3D space, and have wide applications in robotics and computer graphics. Dual complex numbers found application in brain science recently. We establish the interlacing theorem for dual unit gain graphs, and show that the spectral radius of a dual unit gain graph is always not greater than the spectral radius of the underlying graph, and these two radii are equal if and only if the dual gain graph is balanced. By using the dual cosine functions, we establish the closed form of eigenvalues of adjacency and Laplacian matrices of dual complex and quaternion unit gain cycles. We then show the coefficient theorem holds for dual unit gain graphs. Similar results hold for the spectral radius of the Laplacian matrix of the dual unit gain graph too. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_12988 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Spectral Properties of Dual Unit Gain Graphs Cui, Chunfeng Lu, Yong Qi, Liqun Wang, Ligong Combinatorics In this paper, we study dual quaternion and dual complex unit gain graphs and their spectral properties in a unified frame of dual unit gain graphs. Unit dual quaternions represent rigid movements in the 3D space, and have wide applications in robotics and computer graphics. Dual complex numbers found application in brain science recently. We establish the interlacing theorem for dual unit gain graphs, and show that the spectral radius of a dual unit gain graph is always not greater than the spectral radius of the underlying graph, and these two radii are equal if and only if the dual gain graph is balanced. By using the dual cosine functions, we establish the closed form of eigenvalues of adjacency and Laplacian matrices of dual complex and quaternion unit gain cycles. We then show the coefficient theorem holds for dual unit gain graphs. Similar results hold for the spectral radius of the Laplacian matrix of the dual unit gain graph too. |
| title | Spectral Properties of Dual Unit Gain Graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2402.12988 |