Unlocking the walk matrix of a graph

DOI10.1007/s10801-021-01065-3zbMath1489.05096arXiv1911.00062OpenAlexW3211555008MaRDI QIDQ2137059

Fenjin Liu, Johannes Siemons

Publication date: 16 May 2022

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.00062

zbMATH Keywords

spectral decompositionisomorphism problem for graphswalk matrix of graphs

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (4)

Generalized spectral characterizations of a new family of noncontrollable graphs ⋮ Proof of a conjecture on the determinant of the walk matrix of rooted product with a path ⋮ The Smith normal form of the walk matrix of the Dynkin graph \(D_n\) for \(n \equiv 0 \pmod{4}\) ⋮ Cospectrality preserving graph modifications and eigenvector properties via walk equivalence of vertices

Cites Work

• A simple arithmetic criterion for graphs being determined by their generalized spectra
• Generalized spectral characterization of graphs revisited
• A table of connected graphs on six vertices
• On the singularity probability of discrete random matrices
• Spectral conditions for the reconstructibility of a graph
• Random matrices have simple spectrum
• Cospectral graphs, GM-switching and regular rational orthogonal matrices of level \(p\)
• New families of graphs determined by their generalized spectrum
• Low-degree factors of random polynomials
• Controllable subsets in graphs
• Graphs with \(n - 1\) main eigenvalues
• Irreducible polynomials of bounded height
• A sufficient condition for a family of graphs being determined by their generalized spectra
• Main eigenvalues of a graph
• On a Conjecture of Godsil Concerning Controllable Random Graphs
• Algebraic Graph Theory
• Irreducibility of Random Polynomials
• Probabilistic Galois theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Unlocking the walk matrix of a graph