Cover Image

Constructing cospectral hypergraphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Abiad, Aida, Khramova, Antonina P.
Format:	Preprint
Published:	2022
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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)

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

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

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

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

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

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

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)

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)

On cospectral graphons
by: Hladký, Jan, 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)

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

Constructions of $A_α$-cospectral graphs using some corona operations
by: K, Najiya V, 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)

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)

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)

Constructing cospectral graphs by unfolding non-bipartite graphs
by: Kannan, M. Rajesh, 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)

The Eigenvalue Method in Coding Theory
by: Abiad, Aida, et al.
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)

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

On the construction of cospectral nonisomorphic bipartite graphs
by: Kannan, M. Rajesh, et al.
Published: (2021)

A cospectral construction for the generalized distance matrix
by: Friesen, Ori, et al.
Published: (2024)

Construction of non-regular $A_α$-cospectral graphs from some join of graphs
by: K, Najiya V, et al.
Published: (2022)

New arithmetic invariants for cospectral graphs
by: Ji, Yizhe, et al.
Published: (2024)

Degree-similar graphs and cospectral graphs
by: Fan, Yi-Zheng, et al.
Published: (2025)

Which $L$-cospectral graphs have same degree sequences
by: Ye, Jiachang
Published: (2024)

Constructing cospectral graphs via regular rational orthogonal matrix with level two and three
by: Mao, Lihuan, et al.
Published: (2024)