Show simple item record

dc.contributor.authorFilar, Jerzy A
dc.contributor.authorGupta, A
dc.contributor.authorLucas, Stephen K
dc.date.accessioned2012-10-31T05:13:05Z
dc.date.available2012-10-31T05:13:05Z
dc.date.issued2005
dc.identifier.citationFilar, J.A., Gupta, A. and Lucas, S.K., 2005. Connected co-spectral graphs are not necessarily both Hamiltonian. Gazette of the Australian Mathematical Society, 32(3), 193.en
dc.identifier.issn0311-0729
dc.identifier.urihttp://hdl.handle.net/2328/26396
dc.description.abstractThere 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.en
dc.language.isoen
dc.publisherAustralian Mathematical Societyen
dc.subjectMathematicsen
dc.subjectHamiltonian cycle problemen
dc.subjectGraph theoryen
dc.titleConnected co-spectral graphs are not necessarily both Hamiltonianen
dc.typeArticleen
dc.rights.licenseIn Copyright


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record