:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Abiad, Aida, Nishimura, Yusaku
Format:	Preprint
Published:	2026
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2605.11812
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Average hitting times in some $f$-equitable graphs
by: Nishimura, Yusaku
Published: (2023)

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

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

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

Unified bounds for the independence number of graph powers
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)

Eigenvalue bounds for the quantum chromatic number of graph powers
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)

On the average hitting times of weighted Cayley graphs
by: Tanaka, Yuuho
Published: (2023)

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

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)

Improved Gilbert-Varshamov bound for sum-rank-metric codes via graph theory
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)

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)

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

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

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

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

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

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

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

The Kneser chromatic function distinguishes trees
by: Nishimura, Yusaku
Published: (2024)

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

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

On average hitting time and Kemeny's constant for weighted trees
by: Zeng, Ji
Published: (2021)

On combinatorial structure and algebraic characterizations of distance-regular digraphs
by: Monzillo, Giusy, et al.
Published: (2024)

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

On Spherical $T$-Designs in $\mathbb{R}^2$
by: Misawa, Ryutaro, et al.
Published: (2025)

On the average hitting times of the directed wheel
by: Tamura, Shunya
Published: (2026)

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

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

Eigenvalue bounds and alternating rank-metric codes
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)

A note on integer programming methods for mixed radial Moore graphs
by: Abiad, A., et al.
Published: (2026)

On the first hitting time of a high-dimensional orthant
by: Humbert, Emmanuel, et al.
Published: (2024)

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

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