How to Distinguish Cospectral Graphs

Saeree Wananiyakul, Jörn Steuding and Janyarak Tongsomporn ()
Additional contact information
Saeree Wananiyakul: Department of Mathematics and Computer Science, Faculty of Science, Chulalongkorn University, Bangkok 10300, Thailand
Jörn Steuding: Department of Mathematics, Würzburg University, Am Hubland, 97 218 Würzburg, Germany
Janyarak Tongsomporn: School of Science, Walailak University, Nakhon Si Thammarat 80160, Thailand

Mathematics, 2022, vol. 10, issue 24, 1-24

Abstract: We introduce a generalized adjacency matrix in order to distinguish cospectral graphs. Our reasoning is motivated by the work of Johnson and Newman and properties of p -adic numbers. Using a polynomial time algorithm, we comment on computer experiments with which we can distinguish cospectral (non-isomorphic) graphs.

Keywords: graph isomorphism problem; cospectral graphs; generalized adjacency matrix (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/10/24/4802/pdf (application/pdf)
https://www.mdpi.com/2227-7390/10/24/4802/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:10:y:2022:i:24:p:4802-:d:1006088

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().