Cover Image

The Shannon capacity of graph powers

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Abiad, Aida, Dalfó, Cristina, Fiol, Miquel Àngel
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

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

On supertoken graphs
by: Reyes, Mónica A., et al.
Published: (2026)

A note on an infinite family of graphs with all different integral Laplacian eigenvalues
by: Dalfó, C., et al.
Published: (2024)

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)

On token signed graphs
by: Dalfó, C., et al.
Published: (2024)

On Generalized Token Graphs
by: Song, Xiaodi, et al.
Published: (2026)

Token graphs of Cayley graphs as lifts
by: Dalfó, C., et al.
Published: (2024)

On two algebras of token graphs
by: Reyes, M. A., et al.
Published: (2024)

On factored lifts of graphs and their spectra
by: Dalfó, C., et al.
Published: (2024)

On some metric properties of supertoken graphs
by: Baskoro, E. T., et al.
Published: (2024)

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)

On bipartite biregular large graphs
by: Araujo-Pardo, G., 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)

Propagation processes on (hyper)graphs: where zero forcing and burning meet
by: Abiad, Aida, et al.
Published: (2026)

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)

On bipartite $(1,1,k)$-mixed graphs
by: Dalfó, C., et al.
Published: (2024)

On the Algebraic Connectivity of Token Graphs and Graphs under Perturbations
by: Song, X., et al.
Published: (2024)

Structural and Spectral Properties of Chordal Ring, Multi-ring and Mixed Graphs
by: Reyes, M. A., et al.
Published: (2024)

Combined voltage assignments, factored lifts, and their spectra
by: Dalfó, C., et al.
Published: (2024)

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

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)

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)

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

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)

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)

A general method to find the spectrum and eigenspaces of the $k$-token of a cycle, and 2-token through continuous fractions
by: Reyes, M. A., et al.
Published: (2024)

Some inner metric parameters of a digraph: Iterated line digraphs and integer sequences
by: Bong, N. H., et al.
Published: (2024)

Logical aspects of isomorphism of controllable graphs and cospectrality of distance-regularized graphs
by: Abiad, Aida, 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)

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

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)