Metraipolis › archive › dc_46db82e24d8f
A Characterization of Walk-Matrix Equivalence at Corank Two via Reciprocal WQH Switching — arXiv:2609.36895
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.36895
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T18:33:36.629Z
- SHA-256 of the archived text
76e2450902aaf9c778c76826787078ff5263534c379b3fe9a5a06133dace001f- Stable URL of this page
https://metraipolis.com/documento/dc_46db82e24d8f
How to cite
A Characterization of Walk-Matrix Equivalence at Corank Two via Reciprocal WQH Switching — arXiv:2609.36895 — arXiv (en), https://arxiv.org/abs/2609.36895 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_46db82e24d8f (Metraipolis archive dc_46db82e24d8f, sha256 76e2450902aaf9c778c76826787078ff5263534c379b3fe9a5a06133dace001f)
BibTeX
@misc{dc46db82e24d8f,
title = {A Characterization of Walk-Matrix Equivalence at Corank Two via Reciprocal WQH Switching — arXiv:2609.36895},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.36895},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_46db82e24d8f; sha256 76e2450902aaf9c778c76826787078ff5263534c379b3fe9a5a06133dace001f},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.36895. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $G$ be a graph of order $n$ with adjacency matrix $A_G$, let $\mathbf e$ denote the all-one vector, and let$W_G=[\mathbf e,A_G\mathbf e,\ldots,A_G^{n-1}\mathbf e]$ be its walk matrix. We consider the case $\operatorname{rank}W_G=n-2$, the first corank for which distinct graphs can have the same walk matrix. We give a complete structural description of such pairs. More precisely, if $G$ and $H$ are distinct graphs on the same labelled vertex set and $\operatorname{rank}W_G=n-2$, then $W_G=W_H$ if and only if $H$ is obtained from $G$ by a reciprocal Wang--Qiu--Hu (WQH) switching. In this case, $A_G-A_H=uv^T+vu^T$, where $u,v\in\{0,\pm1\}^n$ have disjoint supports and form a basis of $\ker W_G^T$. We also determine the minimum order at which a non-isomorphic corank-two walk mate can occur: no such pair exists for $n\le9$, so the previously known $10$-vertex example is sharp. Starting from a labelled realization of that pair, we use singleton union and join operations, together with the graph coronal, to construct connected non-isomorphic pairs with equal corank-two walk matrices for every $n\ge10$.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-30 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.36895 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T17:59:19.213Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).