Imagen de Portada

Optimization and complexity of inertia-type bounds on the independence and chromatic numbers of graph powers

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Abiad, Aida, van Hoesel, Stan, Michaux, Valentin
Formato:	Preprint
Publicado:	2026
Materias:	Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Eigenvalue bounds for the quantum chromatic number of graph powers
por: Abiad, Aida, et al.
Publicado: (2025)

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

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

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

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

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

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

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

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

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

Switching graphs and Hadamard matrices
por: Abiad, Aida, et al.
Publicado: (2024)

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

Hoffman colorings of graphs
por: Abiad, Aida, et al.
Publicado: (2024)

Bounds for the independence and chromatic numbers of locally sparse graphs
por: Dhawan, Abhishek
Publicado: (2024)

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

On the chromatic numbers of Johnson type graphs
por: Cherkashin, Danila
Publicado: (2025)

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

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

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

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

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

Quantum independence and chromatic numbers
por: Godsil, Chris, et al.
Publicado: (2024)

Unified bounds for the independence number of graphs
por: Zhou, Jiang
Publicado: (2024)

Complexes of graphs with bounded independence number
por: Kim, Minki, et al.
Publicado: (2019)

Ratio bound (Lovász number) versus inertia bound
por: Ihringer, Ferdinand
Publicado: (2023)

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

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

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

Switching methods of level 2 for the construction of cospectral graphs
por: Abiad, Aida, et al.
Publicado: (2024)

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

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

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

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

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

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

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

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

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

Counting independent sets in regular graphs with bounded independence number
por: Galvin, David, et al.
Publicado: (2024)

Spectral bounds for the independence number of graphs and even uniform hypergraphs
por: Hu, Xinyu, et al.
Publicado: (2026)