Cover Image

Eigenvalue bounds for the quantum chromatic number of graph powers

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Abiad, Aida, Jany, Benjamin
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Eigenvalue bounds for the distance-$t$ chromatic number of a graph and their application to Lee codes
by: Abiad, Aida, et al.
Published: (2024)

Optimization and complexity of inertia-type bounds on the independence and chromatic numbers of graph powers
by: Abiad, Aida, et al.
Published: (2026)

Unified bounds for the independence number of graph powers
by: Abiad, Aida, et al.
Published: (2024)

Eigenvalue bounds for distance-edge colorings
by: Abiad, Aida, et al.
Published: (2025)

The clique number of the exact distance $t$-power graph: complexity and eigenvalue bounds
by: Abiad, Aida, et al.
Published: (2024)

Eigenvalue bounds and alternating rank-metric codes
by: Abiad, Aida, et al.
Published: (2024)

The Shannon capacity of graph powers
by: Abiad, Aida, et al.
Published: (2025)

The Eigenvalue Method in Coding Theory
by: Abiad, Aida, et al.
Published: (2025)

Improved Gilbert-Varshamov bound for sum-rank-metric codes via graph theory
by: Abiad, Aida, et al.
Published: (2025)

On the chromatic number of powers of subdivisions of graphs
by: Anastos, Michael, et al.
Published: (2024)

On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme
by: Abiad, Aida, et al.
Published: (2023)

Switching graphs and Hadamard matrices
by: Abiad, Aida, et al.
Published: (2024)

On the $Z_q$-forcing number: computational approach and exact values
by: Abiad, Aida, et al.
Published: (2025)

Propagation processes on (hyper)graphs: where zero forcing and burning meet
by: Abiad, Aida, et al.
Published: (2026)

An algebraic-combinatorial framework for finding the average hitting times in graphs with high regularity
by: Abiad, Aida, et al.
Published: (2026)

A unified framework for the Expander Mixing Lemma for irregular graphs and its applications
by: Abiad, Aida, et al.
Published: (2024)

The oriented chromatic number of random graphs of bounded degree
by: Gunderson, Karen, et al.
Published: (2022)

The edge-isoperimetric number of graphs and their powers: approaches from spectral graph theory, optimization and finite geometry
by: Abiad, Aida, et al.
Published: (2026)

Hoffman colorings of graphs
by: Abiad, Aida, et al.
Published: (2024)

On the quantum chromatic number of Hamming and generalized Hadamard graphs
by: Cao, Xiwang, et al.
Published: (2025)

On the existence of small strictly Neumaier graphs
by: Abiad, Aida, et al.
Published: (2023)

New lower bounds on the non-repetitive chromatic number of some graphs
by: Tao, Tianyi, et al.
Published: (2025)

Note on the product of the largest and the smallest eigenvalue of a graph
by: Abiad, Aida, et al.
Published: (2024)

On the sum of the largest and smallest eigenvalues of odd-cycle free graphs
by: Abiad, Aida, et al.
Published: (2025)

Hoffman colorability of (strongly) regular graphs
by: Abiad, Aida, et al.
Published: (2025)

Minimum non-chromatic-choosable graphs with given chromatic number
by: Zhu, Jialu, et al.
Published: (2022)

Counting cospectral graphs obtained via switching
by: Abiad, Aida, et al.
Published: (2025)

On $(n,m)$-chromatic numbers of graphs having bounded sparsity parameters
by: Das, Sandip, et al.
Published: (2023)

On the chromatic numbers of Johnson type graphs
by: Cherkashin, Danila
Published: (2025)

Common graphs with arbitrary chromatic number
by: Kral, Daniel, et al.
Published: (2022)

A graph energy conjecture through the lenses of semidefinite programming
by: Abiad, Aida, et al.
Published: (2025)

Efficient spectral bounds on the chromatic number of Hamming, Johnson, and Kneser graph powers
by: Steinke, Finn A., et al.
Published: (2026)

On graphs with maximum difference between game chromatic number and chromatic number
by: Hollom, Lawrence
Published: (2023)

The exact quantum chromatic number of Hadamard graphs
by: McNamara, Meenakshi
Published: (2024)

Logical aspects of isomorphism of controllable graphs and cospectrality of distance-regularized graphs
by: Abiad, Aida, et al.
Published: (2026)

On the distinguishing chromatic number in hereditary graph classes
by: Brause, Christoph, et al.
Published: (2025)

Upper bounds on the odd graceful chromatic number of graphs
by: Afifurrahman, Muhammad, et al.
Published: (2025)

Bounds for the Grundy chromatic number of graphs in terms of domination number
by: Khaleghi, Abbas, et al.
Published: (2022)

Tales of Hoffman: from a distance
by: Abiad, Aida, et al.
Published: (2025)

A linear programming bound for sum-rank metric codes
by: Abiad, Aida, et al.
Published: (2024)