Cover Image

On the $Z_q$-forcing number: computational approach and exact values

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Abiad, Aida, Moghaddas, Maryam
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

The clique number of the exact distance $t$-power graph: complexity and eigenvalue bounds
by: Abiad, Aida, 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)

Propagation processes on (hyper)graphs: where zero forcing and burning meet
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 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)

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

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

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)

Switching graphs and Hadamard matrices
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)

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

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)

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

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

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

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

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

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

Isomorphism in Union-Closed Sets
by: Mehr, M. J. Moghaddas
Published: (2025)

Infinitely many counterexamples to a conjecture of Lovász
by: Abiad, Aida, et al.
Published: (2025)

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

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

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

Bounds on the game isolation number and exact values for paths and cycles
by: Bujtás, Csilla, et al.
Published: (2025)

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

Proving exact values for the $2$-limited broadcast domination number on grid graphs
by: Slobodin, Aaron, et al.
Published: (2021)

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

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

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

Principal Non-singularity of Fourier Matrices on $\mathbb Z_p \times \mathbb Z_q$ and $\mathbb Z_2^k \times \mathbb Z_q$
by: Zhou, Weiqi
Published: (2025)

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

An exact value for the Ramsey number $R(K_5, K_{5-e})$
by: Angeltveit, Vigleik
Published: (2026)

A general switching method for constructing E-cospectral hypergraphs
by: Abiad, Aida, et al.
Published: (2026)

A Spectral Approach to Kemeny's Constant
by: Abiad, Aida, et al.
Published: (2025)

On $k$-coalition in graphs: bounds and exact values
by: Brešar, Boštjan, et al.
Published: (2025)

Triple systems with bounded matching number: some constructions and exact Turán number
by: Chen, Nannan, et al.
Published: (2025)

Fractional forcing number of graphs
by: Ebrahimi, Javad B., et al.
Published: (2020)