Distinguishing graphs by their spectra, Smith normal forms and complements

The search for a highly discriminating and easily computable invariant to distinguish graphs remains a challenging research topic. Here we focus on cospectral graphs whose complements are also cospectral (generalized cospectral), and on coinvariant graphs (same Smith normal form) whose complements a...

Full description

Saved in:
Bibliographic Details
Main Authors Abiad, Aida, Alfaro, Carlos A, Villagrán, Ralihe R
Format Journal Article
LanguageEnglish
Published 14.04.2023
Subjects
Mathematics - Combinatorics
Online AccessGet full text

Cover

More Information
Summary:The search for a highly discriminating and easily computable invariant to distinguish graphs remains a challenging research topic. Here we focus on cospectral graphs whose complements are also cospectral (generalized cospectral), and on coinvariant graphs (same Smith normal form) whose complements are also coinvariant (generalized coinvariant). We show a new characterization of generalized cospectral graphs in terms of codeterminantal graphs. We also establish the Smith normal form of some graph classes for certain associated matrices, and as an application, we prove that the Smith normal form can be used to uniquely determine star graphs. Finally, for graphs up to 10 vertices, we present enumeration results on the number of generalized cospectral graphs and generalized coinvariant graphs with respect to several associated matrices.
DOI:10.48550/arxiv.2304.07217