Connected co-spectral graphs are not necessarily both Hamiltonian
| Autor: | Filar, Jerzy A, Gupta, A, Lucas, Stephen K |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2005 |
| Předmět: | |
| Zdroj: | IndraStra Global. |
| ISSN: | 2381-3652 |
| Popis: | There are many examples of co-spectral graphs where one is connected while the other is not. A Hamiltonian cycle is a closed path that visits every vertex exactly once. Naturally, a graph needs to be connected to be Hamiltonian. We are not aware of any statements in the literature relating co-spectral graphs and Hamiltonicity. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|