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
Type  article
Stage   submitted
Date   2019-12-15
Version   v1
Language   en ?
arXiv  1912.07061v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: f211c39a-9fbb-4e18-b1a1-3b0e97c099a8
API URL: JSON