Laplacian Pair State Transfer on Total Graphs
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866916044208078848 |
|---|---|
| author | Kalita, Akash Bhattacharjya, Bikash |
| author_facet | Kalita, Akash Bhattacharjya, Bikash |
| contents | The total graph of a graph $G$, denoted $\mathcal{T}(G)$, is defined as the graph whose vertex set is the union of the vertex set of $G$ and the edge set of $G$, such that two vertices of $\mathcal{T}(G)$ are adjacent if the corresponding elements of $G$ are either adjacent or incident. In this paper, we investigate the existence of Laplacian perfect pair state transfer and Laplacian pretty good pair state transfer on $\mathcal{T}(G)$, where $G$ is an $r$-regular graph. We prove that if $G$ is Laplacian integral, $r \geq 3$, and $r+1$ is not a Laplacian eigenvalue of $G$, then $\mathcal{T}(G)$ does not exhibit Laplacian perfect pair state transfer. In addition, we prove that under some mild conditions, $\mathcal{T}(G)$ exhibits Laplacian pretty good pair state transfer, where $r \geq 3$ and $r+1$ is not a Laplacian eigenvalue of $G$. Using these conditions, we obtain several infinite families of total graphs exhibiting Laplacian pretty good pair state transfer that fail to exhibit Laplacian perfect pair state transfer. We also prove that the total graph of the complete graph $K_n$ exhibits Pair-LPGST if and only if $n=3$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_08684 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Laplacian Pair State Transfer on Total Graphs Kalita, Akash Bhattacharjya, Bikash Combinatorics 15A16, 05C50, 81P68 The total graph of a graph $G$, denoted $\mathcal{T}(G)$, is defined as the graph whose vertex set is the union of the vertex set of $G$ and the edge set of $G$, such that two vertices of $\mathcal{T}(G)$ are adjacent if the corresponding elements of $G$ are either adjacent or incident. In this paper, we investigate the existence of Laplacian perfect pair state transfer and Laplacian pretty good pair state transfer on $\mathcal{T}(G)$, where $G$ is an $r$-regular graph. We prove that if $G$ is Laplacian integral, $r \geq 3$, and $r+1$ is not a Laplacian eigenvalue of $G$, then $\mathcal{T}(G)$ does not exhibit Laplacian perfect pair state transfer. In addition, we prove that under some mild conditions, $\mathcal{T}(G)$ exhibits Laplacian pretty good pair state transfer, where $r \geq 3$ and $r+1$ is not a Laplacian eigenvalue of $G$. Using these conditions, we obtain several infinite families of total graphs exhibiting Laplacian pretty good pair state transfer that fail to exhibit Laplacian perfect pair state transfer. We also prove that the total graph of the complete graph $K_n$ exhibits Pair-LPGST if and only if $n=3$. |
| title | Laplacian Pair State Transfer on Total Graphs |
| topic | Combinatorics 15A16, 05C50, 81P68 |
| url | https://arxiv.org/abs/2602.08684 |