Gain distance Laplacian matrices for complex unit gain graphs
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913330315132928 |
|---|---|
| author | Khan, Suliman |
| author_facet | Khan, Suliman |
| contents | A complex unit gain graph (or a $\mathbb{T}$-gain graph) $Θ(Σ,φ)$ is a graph where the unit complex number is assign by a function $φ$ to every oriented edge of $Σ$ and assign its inverse to the opposite orientation. In this paper, we define the two gain distance Laplacian matrices $DL^{\max}_{<}(Θ)$ and $DL^{\min}_{<}(Θ)$ corresponding to the two gain distance matrices $D^{\max}_{<}(Θ)$ and $D^{\min}_{<}(Θ)$ defined for $\mathbb{T}$-gain graphs $Θ(Σ,φ)$, for any vertex ordering $(V(Σ),<)$. Furthermore, we provide the characterization of singularity and find formulas for the rank of those Laplacian matrices. We also establish two types of characterization for balanced in complex unit gain graphs while using the gain distance Lapalcian matrices. Most of the results are derived by proving them more generally for weighted $\mathbb{T}$-gain graphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_17085 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Gain distance Laplacian matrices for complex unit gain graphs Khan, Suliman Combinatorics 05C05, 05C50 A complex unit gain graph (or a $\mathbb{T}$-gain graph) $Θ(Σ,φ)$ is a graph where the unit complex number is assign by a function $φ$ to every oriented edge of $Σ$ and assign its inverse to the opposite orientation. In this paper, we define the two gain distance Laplacian matrices $DL^{\max}_{<}(Θ)$ and $DL^{\min}_{<}(Θ)$ corresponding to the two gain distance matrices $D^{\max}_{<}(Θ)$ and $D^{\min}_{<}(Θ)$ defined for $\mathbb{T}$-gain graphs $Θ(Σ,φ)$, for any vertex ordering $(V(Σ),<)$. Furthermore, we provide the characterization of singularity and find formulas for the rank of those Laplacian matrices. We also establish two types of characterization for balanced in complex unit gain graphs while using the gain distance Lapalcian matrices. Most of the results are derived by proving them more generally for weighted $\mathbb{T}$-gain graphs. |
| title | Gain distance Laplacian matrices for complex unit gain graphs |
| topic | Combinatorics 05C05, 05C50 |
| url | https://arxiv.org/abs/2404.17085 |