Spectral upper bound on the quantum k-independence number of a graph

zbMath1495.05244arXiv1910.07339MaRDI QIDQ5097504

Clive Elphick, Aida Abiad, Paweł Wocjan

Publication date: 25 August 2022

Full work available at URL: https://arxiv.org/abs/1910.07339

zbMATH Keywords

eigenvaluesinertia boundquantum independence number

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

On inertia and ratio type bounds for the \(k\)-independence number of a graph and their relationship ⋮ Optimization of eigenvalue bounds for the independence and chromatic number of graph powers

Cites Work

• Unnamed Item
• Quantum homomorphisms
• Spectral bounds for the \(k\)-independence number of a graph
• On the quantum chromatic number of a graph
• Eigenvalue interlacing and weight parameters of graphs
• Independence and average distance in graphs
• Graphs with constant \(\mu\) and \(\overline{\mu}\)
• A graph for which the inertia bound is not tight
• Interlacing eigenvalues and graphs
• Optimization of eigenvalue bounds for the independence and chromatic number of graph powers
• Spectral lower bounds for the quantum chromatic number of a graph. II
• On the \(k\)-independence number of graphs
• The theta number of simplicial complexes
• Spectral lower bounds for the quantum chromatic number of a graph
• Deciding the existence of perfect entangled strategies for nonlocal games
• Weighted matrix eigenvalue bounds on the independence number of a graph
• Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone
• On the Shannon capacity of a graph

This page was built for publication: Spectral upper bound on the quantum k-independence number of a graph