BibTeX
CSL-JSON
MLA
Harvard
On NP-hard graph properties characterized by the spectrum
release_ku5aowywtjazdhkgjbpclnkddm
by
Omid Etesami, Willem H. Haemers
Released
as a article
.
2019
Abstract
Properties of graphs that can be characterized by the spectrum of the
adjacency matrix of the graph have been studied systematically recently.
Motivated by the complexity of these properties, we show that there are such
properties for which testing whether a graph has that property can be NP-hard
(or belong to other computational complexity classes consisting of even harder
problems). In addition, we discuss a possible spectral characterization of some
well-known NP-hard problems. In particular, for every integer k≥ 6 we
construct a pair of k-regular cospectral graphs, where one graph is
Hamiltonian and the other one not.
In text/plain
format
Archived Files and Locations
application/pdf 431.9 kB
file_ljfr2wiftve4lfv5kq3ngjbfqe
|
arxiv.org (repository) web.archive.org (webarchive) |
Read Archived PDF
Preserved and Accessible
arXiv
1912.07061v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links