Cover Image

On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Abiad, Aida, Simoens, Robin, Zeijlemaker, Sjanne
Format:	Preprint
Published:	2023
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

Counting cospectral graphs obtained via switching
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)

Switching methods of level 2 for the construction of cospectral graphs
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)

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

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)

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

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

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

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

Design switching on graphs
by: Ihringer, Ferdinand, et al.
Published: (2025)

Quantum chromatic numbers of some graphs in Hamming schemes
by: Cao, Xiwang, 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)

Hoffman colorings of graphs
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)

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

Burning numbers via eigenpolytopes -- Hamming graphs, Johnson graphs, and halved cubes
by: Tanaka, Hajime, et al.
Published: (2025)

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 for distance-edge colorings
by: Abiad, Aida, et al.
Published: (2025)

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

The zero forcing numbers and propagation times of gear graphs and helm graphs
by: Anderton, Sara, et al.
Published: (2023)

The balancing number and list balancing number of some graph classes
by: Dailly, Antoine, et al.
Published: (2020)

Pseudo-Euclidean representations of switching classes of Johnson and Hamming graphs with minimal dimension
by: Nozaki, Hiroshi, et al.
Published: (2025)

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

On the clique covering numbers of Johnson graphs
by: Jørgensen, Søren Fuglede
Published: (2025)

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

Tales of Hoffman: from a distance
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)

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

The zero blocking numbers of generalized Kneser graphs and generalized Johnson graphs
by: Lin, Hau-Yi, et al.
Published: (2025)

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

Oriented diameter of graphs with given domination number
by: Wang, Xiaolin, et al.
Published: (2025)

An upper bound on the number of relevant variables for Boolean functions on the Hamming graph
by: Valyuzhenich, Alexandr
Published: (2024)

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