Imagen de Portada

Completely regular codes in graphs covered by a Hamming graph

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Goryainov, Sergey, Krotov, Denis
Formato:	Preprint
Publicado:	2024
Materias:	Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

The spectral Turán problem: Characterizing spectral-consistent graphs
por: Fang, Longfei, et al.
Publicado: (2025)

Completely regular codes with covering radius 1 and the second eigenvalue in 3-dimensional Hamming graphs
por: Mogilnykh, Ivan, et al.
Publicado: (2024)

Divisible design graphs from symplectic graphs over rings with precisely three ideals
por: Bhowmik, Anwita, et al.
Publicado: (2024)

Tightness of the weight-distribution bound for strongly regular polar graphs
por: Evans, Rhys J., et al.
Publicado: (2024)

On eigenfunctions of the block graphs of geometric Steiner systems
por: Goryainov, Sergey, et al.
Publicado: (2023)

Extremal Peisert-type graphs without the strict-EKR property
por: Goryainov, Sergey, et al.
Publicado: (2023)

Divisible design graphs with selfloops
por: Bhowmik, Anwita, et al.
Publicado: (2025)

Non-canonical maximum cliques without a design structure in the block graphs of 2-designs
por: Goryainov, Sergey, et al.
Publicado: (2023)

Second largest maximal cliques in small Paley graphs of square order
por: Chen, Huye, et al.
Publicado: (2024)

Cliques in Paley graphs of square order and in Peisert graphs
por: Brouwer, Andries E., et al.
Publicado: (2025)

The classification of orthogonal arrays OA(2048,14,2,7) and some completely regular codes
por: Krotov, Denis S.
Publicado: (2023)

Thin divisible designs graphs: an interplay between fixed-point free involutions of $(v,k,λ)$-graphs and symmetric weighing matrices
por: Goryainov, Sergey, et al.
Publicado: (2025)

A family of Neumaier graphs containing examples with exactly five eigenvalues
por: De Bruyn, Bart, et al.
Publicado: (2026)

Divisible design graphs from the symplectic graph
por: De Bruyn, Bart, et al.
Publicado: (2024)

Burning Hamming graphs
por: Tokushige, Norihide
Publicado: (2024)

Projective tilings and full-rank perfect codes
por: Krotov, Denis S.
Publicado: (2022)

On Neumaier Cayley graphs
por: Evans, Rhys J., et al.
Publicado: (2026)

Bootstrap percolation on the Hamming graphs
por: Miralaei, Meysam, et al.
Publicado: (2024)

Sensitivity and Hamming graphs
por: Asensio, Sara, et al.
Publicado: (2025)

Multifold 1-perfect codes
por: Krotov, Denis S.
Publicado: (2022)

Some results on Hamming graphs and an extended Hamming graphs
por: Zafari, Ali, et al.
Publicado: (2025)

Total mutual-visibility in Hamming graphs
por: Bujtás, Csilla, et al.
Publicado: (2023)

Limited-visibility Cops and Robbers on Hamming graphs
por: Jones, John, et al.
Publicado: (2025)

On strong nodal domains for eigenfunctions of Hamming graphs
por: Valyuzhenich, Alexandr, et al.
Publicado: (2025)

On the weak $k$-metric dimension of Hamming graphs
por: Fernandez, Elena, et al.
Publicado: (2025)

Generalized ovals, 2.5-dimensional additive codes, and multispreads
por: Krotov, Denis S., et al.
Publicado: (2025)

Treewidth of generalized Hamming graph, bipartite Kneser graph and generalized Petersen graph
por: Wang, Yichen, et al.
Publicado: (2024)

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

Do K33-Free Latin Squares Exist?
por: Krotov, Aleksandr D., et al.
Publicado: (2023)

Constructing MRD codes by switching
por: Shi, Minjia, et al.
Publicado: (2022)

On vertex-transitive distance-regular covers of complete graphs with an extremal smallest eigenvalue
por: Tsiovkina, Ludmila Yu.
Publicado: (2024)

The distance spectrum of the bipartite double cover of strongly regular graphs
por: Mirafzal, S. Morteza
Publicado: (2025)

Up to a double cover, every regular connected graph is isomorphic to a Schreier graph
por: Leemann, Paul-Henry
Publicado: (2020)

Equitable [[2,10],[6,6]]-partitions of the 12-cube
por: Krotov, Denis S.
Publicado: (2020)

On the $Q$-polynomial property of the full bipartite graph of a Hamming graph
por: Fernández, Blas, et al.
Publicado: (2024)

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

Bootstrap percolation on the high-dimensional Hamming graph
por: Kang, Mihyun, et al.
Publicado: (2024)

Hamiltonicity of covering graphs of trees
por: Bradshaw, Peter, et al.
Publicado: (2022)

Low-degree functions without non-essential arguments
por: Krotov, Denis S.
Publicado: (2024)

Lifting automorphisms along abelian regular coverings of graphs
por: Chen, Haimiao
Publicado: (2011)