Enumeration of cospectral and coinvariant graphs

DOI10.1016/j.amc.2021.126348OpenAlexW3164121554MaRDI QIDQ2243334

Aida Abiad, Carlos A. Alfaro

Publication date: 11 November 2021

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

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

zbMATH Keywords

eigenvaluesenumerationinvariant factorsSmith normal formgraph invariant

Mathematics Subject Classification ID

Graph theory (05Cxx) Algebraic combinatorics (05Exx) Designs and configurations (05Bxx)

Related Items (4)

Codeterminantal graphs ⋮ Differentiate data by higher-order structures ⋮ Delta invariant for Eulerian digraphs ⋮ Spectral determination of graphs with one positive anti-adjacency eigenvalue

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Switched symplectic graphs and their 2-ranks
• Two Laplacians for the distance matrix of a graph
• On the distance Laplacian spectra of graphs
• Constructing cospectral graphs
• Spectra of graphs
• On the sandpile group of the cone of a graph
• Signless Laplacians of finite graphs
• Elementary divisors of graphs and matroids
• Chip-firing and the critical group of a graph
• Which graphs are determined by their spectrum?
• Enumeration of cospectral graphs.
• On the \(p\)-ranks of the adjacency matrices of distance-regular graphs
• Uniqueness of strongly regular graphs having minimal \(p\)-rank
• On graphs with 2 trivial distance ideals
• Cospectrality of graphs with respect to distance matrices
• Determining graphs by the complementary spectrum
• Distance ideals of graphs
• Cospectral graphs on 12 vertices
• Graphs that are cospectral for the distance Laplacian
• Distance unimodular equivalence of graphs
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• Some properties of the distance Laplacian eigenvalues of a graph

This page was built for publication: Enumeration of cospectral and coinvariant graphs