How to Distinguish Cospectral Graphs
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 <i>p</i>-adic numbers. Using a polynomial time algorithm, we comment on computer experiments with which we can distinguish...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2022-12-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/10/24/4802 |
| _version_ | 1797456496093560832 |
|---|---|
| author | Saeree Wananiyakul Jörn Steuding Janyarak Tongsomporn |
| author_facet | Saeree Wananiyakul Jörn Steuding Janyarak Tongsomporn |
| author_sort | Saeree Wananiyakul |
| collection | DOAJ |
| description | 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 <i>p</i>-adic numbers. Using a polynomial time algorithm, we comment on computer experiments with which we can distinguish cospectral (non-isomorphic) graphs. |
| first_indexed | 2024-03-09T16:08:39Z |
| format | Article |
| id | doaj.art-ffeca5a6c42544ce8d9802980ad71217 |
| institution | Directory Open Access Journal |
| issn | 2227-7390 |
| language | English |
| last_indexed | 2024-03-09T16:08:39Z |
| publishDate | 2022-12-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Mathematics |
| spelling | doaj.art-ffeca5a6c42544ce8d9802980ad712172023-11-24T16:29:57ZengMDPI AGMathematics2227-73902022-12-011024480210.3390/math10244802How to Distinguish Cospectral GraphsSaeree Wananiyakul0Jörn Steuding1Janyarak Tongsomporn2Department of Mathematics and Computer Science, Faculty of Science, Chulalongkorn University, Bangkok 10300, ThailandDepartment of Mathematics, Würzburg University, Am Hubland, 97 218 Würzburg, GermanySchool of Science, Walailak University, Nakhon Si Thammarat 80160, ThailandWe 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 <i>p</i>-adic numbers. Using a polynomial time algorithm, we comment on computer experiments with which we can distinguish cospectral (non-isomorphic) graphs.https://www.mdpi.com/2227-7390/10/24/4802graph isomorphism problemcospectral graphsgeneralized adjacency matrix |
| spellingShingle | Saeree Wananiyakul Jörn Steuding Janyarak Tongsomporn How to Distinguish Cospectral Graphs Mathematics graph isomorphism problem cospectral graphs generalized adjacency matrix |
| title | How to Distinguish Cospectral Graphs |
| title_full | How to Distinguish Cospectral Graphs |
| title_fullStr | How to Distinguish Cospectral Graphs |
| title_full_unstemmed | How to Distinguish Cospectral Graphs |
| title_short | How to Distinguish Cospectral Graphs |
| title_sort | how to distinguish cospectral graphs |
| topic | graph isomorphism problem cospectral graphs generalized adjacency matrix |
| url | https://www.mdpi.com/2227-7390/10/24/4802 |
| work_keys_str_mv | AT saereewananiyakul howtodistinguishcospectralgraphs AT jornsteuding howtodistinguishcospectralgraphs AT janyaraktongsomporn howtodistinguishcospectralgraphs |