Item

On NP-hard graph properties characterized by the spectrum

Etesami,Omid
; 
Haemers,Willem H.
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 properties. 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.
Description
Date
2020-10-15
Journal Title
Journal ISSN
Volume Title
Publisher
Collections
Tilburg University Research Output Collection
Show all metadata
Research Projects
Organizational Units
Journal Issue
Keywords
Computational complexity, Cospectral graphs, Hamiltonian graph, Latin square, NP-hard problem, Spectral characterization
Citation
Etesami, O & Haemers, W H 2020, 'On NP-hard graph properties characterized by the spectrum', Discrete Applied Mathematics, vol. 285, pp. 526-529. https://doi.org/10.1016/j.dam.2020.06.020
URI
https://hdl.handle.net/20.500.14602/73566
Embedded videos