Laplacian state transfer in graphs with involutions
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914499271852032 |
|---|---|
| author | Ojha, Swornalata Monterde, Hermie Pal, Hiranmoy |
| author_facet | Ojha, Swornalata Monterde, Hermie Pal, Hiranmoy |
| contents | For $q\in\mathbb{R}\backslash\{0\}$, the generalized Laplacian of a graph $X$ is the matrix $\mathscr{L}=Δ+qA$, where $Δ$ is the degree matrix and $A$ is the adjacency matrix of $X$. In this paper, we investigate perfect state transfer (PST) on graphs with possible loops equipped with non-trivial involutions, where we take the generalized Laplacian matrix as the Hamiltonian of the underlying spin network. We establish an equivalence between the existence of PST between certain pair (or plus states) in such a graph and PST between vertices in a subgraph induced by the involution. This allows us to prove that for almost all simple unweighted planar graphs (resp., almost all simple unweighted trees), the assignment of loops of weight one to exactly two vertices in the graph produces PST between pair states relative to $\mathscr{L}$. We also show that a path on $n$ vertices admits PST between end vertices relative to $\mathscr{L}$ if and only if $n =2$, or $(n,q)=(3,\frac{k^2-l^2}{8l^2})$ where $k>l$ are integers with $k \not\equiv l \pmod{2}$. For cycles, we show that the addition of an extra edge does not yield PST between vertices relative to Laplacian and signless Laplacian matrices. Furthermore, we show that the addition of a few suitable edges (including loops) in complete bipartite graphs, cycles, and paths yields PST between pair states. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_20700 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Laplacian state transfer in graphs with involutions Ojha, Swornalata Monterde, Hermie Pal, Hiranmoy Combinatorics 15A16, 05C50, 81P45 For $q\in\mathbb{R}\backslash\{0\}$, the generalized Laplacian of a graph $X$ is the matrix $\mathscr{L}=Δ+qA$, where $Δ$ is the degree matrix and $A$ is the adjacency matrix of $X$. In this paper, we investigate perfect state transfer (PST) on graphs with possible loops equipped with non-trivial involutions, where we take the generalized Laplacian matrix as the Hamiltonian of the underlying spin network. We establish an equivalence between the existence of PST between certain pair (or plus states) in such a graph and PST between vertices in a subgraph induced by the involution. This allows us to prove that for almost all simple unweighted planar graphs (resp., almost all simple unweighted trees), the assignment of loops of weight one to exactly two vertices in the graph produces PST between pair states relative to $\mathscr{L}$. We also show that a path on $n$ vertices admits PST between end vertices relative to $\mathscr{L}$ if and only if $n =2$, or $(n,q)=(3,\frac{k^2-l^2}{8l^2})$ where $k>l$ are integers with $k \not\equiv l \pmod{2}$. For cycles, we show that the addition of an extra edge does not yield PST between vertices relative to Laplacian and signless Laplacian matrices. Furthermore, we show that the addition of a few suitable edges (including loops) in complete bipartite graphs, cycles, and paths yields PST between pair states. |
| title | Laplacian state transfer in graphs with involutions |
| topic | Combinatorics 15A16, 05C50, 81P45 |
| url | https://arxiv.org/abs/2604.20700 |