Cover Image

Unified bounds for the independence number of graph powers

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Abiad, Aida, Zhou, Jiang
Format:	Preprint
Published:	2024
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 quantum chromatic number of graph powers
by: Abiad, Aida, et al.
Published: (2025)

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

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

Unified bounds for the independence number of graphs
by: Zhou, Jiang
Published: (2024)

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

The Shannon capacity of graph powers
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)

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

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)

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

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

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

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)

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

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

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)

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

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

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

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

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

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

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

Constructing cospectral hypergraphs
by: Abiad, Aida, et al.
Published: (2022)

Sharp lower bounds and extremal graphs for the generalized $k$-independence number
by: Huang, Jing, et al.
Published: (2025)

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

Comparing the $p$-independence number of regular graphs to the $q$-independence number of their line graphs
by: Caro, Yair, et al.
Published: (2024)

Hadwiger's Conjecture for some graphs with independence number two
by: Li, Tong, et al.
Published: (2023)

Semidefinite and linear programming bounds for sum-rank-metric codes and non-existence results
by: Abiad, Aida, et al.
Published: (2026)

Lower bounds on the independence numbers of distance graphs with vertices in $\{-1, 0, 1\}^n$
by: Akhiiarov, A. R., et al.
Published: (2024)

The minimum number of maximal independent sets in graphs with given order and independence number
by: Tian, Yuting, et al.
Published: (2024)

Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
by: Botler, Fábio, et al.
Published: (2025)

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

Computing fixed point free automorphisms of graphs
by: Abiad, Aida, et al.
Published: (2026)