New families of graphs determined by their generalized spectrum
classification
🧮 math.CO
keywords
graphsdeterminantdeterminedfamiliesgeneralizedmatrixspectrumwalk
read the original abstract
We construct infinite families of graphs that are determined by their generalized spectrum. This construction is based on new formulae for the determinant of the walk matrix of a graph. The graphs constructed here all satisfy a lower divisibility for the determinant of their walk matrix.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.