Completely regular codes with covering radius 1 and the second eigenvalue in 3-dimensional Hamming graphs
Fuente:
arXiv
Saved in:
| Main Authors: | Mogilnykh, Ivan, Taranenko, Anna, Vorob'ev, Konstantin |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
On strong nodal domains for eigenfunctions of Hamming graphs
by: Valyuzhenich, Alexandr, et al.
Published: (2025)
by: Valyuzhenich, Alexandr, et al.
Published: (2025)
On extended perfect codes
by: Vorob'ev, Konstantin
Published: (2024)
by: Vorob'ev, Konstantin
Published: (2024)
On binary codes with distances $d$ and $d+2$
by: Landjev, Ivan, et al.
Published: (2024)
by: Landjev, Ivan, et al.
Published: (2024)
Completely regular codes in graphs covered by a Hamming graph
by: Goryainov, Sergey, et al.
Published: (2024)
by: Goryainov, Sergey, et al.
Published: (2024)
An upper bound on the size of a code with $s$ distances
by: Landjev, Ivan, et al.
Published: (2025)
by: Landjev, Ivan, et al.
Published: (2025)
Binary codes from subset inclusion matrices
by: Marin, Alexey D., et al.
Published: (2024)
by: Marin, Alexey D., et al.
Published: (2024)
On null completely regular codes in Manhattan metric
by: Mogilnykh, I. Yu., et al.
Published: (2025)
by: Mogilnykh, I. Yu., et al.
Published: (2025)
A lower bound of toughness of regular graphs: in terms of second largest eigenvalue
by: Zhang, Wenqian
Published: (2026)
by: Zhang, Wenqian
Published: (2026)
On vertex-transitive distance-regular covers of complete graphs with an extremal smallest eigenvalue
by: Tsiovkina, Ludmila Yu.
Published: (2024)
by: Tsiovkina, Ludmila Yu.
Published: (2024)
On the maximum second eigenvalue of outerplanar graphs
by: Brooks, George, et al.
Published: (2023)
by: Brooks, George, et al.
Published: (2023)
The radius capture number
by: Dravec, Tanja, et al.
Published: (2025)
by: Dravec, Tanja, et al.
Published: (2025)
On the first two eigenvalues of regular graphs
by: Zhang, Shengtong
Published: (2023)
by: Zhang, Shengtong
Published: (2023)
Optimal codes and arcs for the generalized Hamming weights
by: Kurz, Sascha, et al.
Published: (2026)
by: Kurz, Sascha, et al.
Published: (2026)
A new reducibility results for minihypers in finite projective geometries
by: Landjev, Ivan, et al.
Published: (2025)
by: Landjev, Ivan, et al.
Published: (2025)
On the $D_α$ spectral radius of non-transmission regular graphs
by: Xu, Zengzhao, et al.
Published: (2024)
by: Xu, Zengzhao, et al.
Published: (2024)
Burning Hamming graphs
by: Tokushige, Norihide
Published: (2024)
by: Tokushige, Norihide
Published: (2024)
Bootstrap percolation on the high-dimensional Hamming graph
by: Kang, Mihyun, et al.
Published: (2024)
by: Kang, Mihyun, et al.
Published: (2024)
Spectral radius and size conditions for fractional $(a,b,m)$-covered graphs
by: Xu, Zengzhao, et al.
Published: (2025)
by: Xu, Zengzhao, et al.
Published: (2025)
On the second largest eigenvalue of certain graphs in the perfect matching association scheme
by: Gupta, Himanshu, et al.
Published: (2025)
by: Gupta, Himanshu, et al.
Published: (2025)
Bootstrap percolation on the Hamming graphs
by: Miralaei, Meysam, et al.
Published: (2024)
by: Miralaei, Meysam, et al.
Published: (2024)
Tricyclic graphs for which the second largest distance eigenvalue less than $-\frac{1}{2}$
by: Yang, Kexin, et al.
Published: (2025)
by: Yang, Kexin, et al.
Published: (2025)
Sensitivity and Hamming graphs
by: Asensio, Sara, et al.
Published: (2025)
by: Asensio, Sara, et al.
Published: (2025)
Non-backtracking eigenvalues and eigenvectors of random regular graphs and hypergraphs
by: Zhu, Xiangyi, et al.
Published: (2023)
by: Zhu, Xiangyi, et al.
Published: (2023)
Total mutual-visibility in Hamming graphs
by: Bujtás, Csilla, et al.
Published: (2023)
by: Bujtás, Csilla, et al.
Published: (2023)
Some bounds on the spectral radius of connected threshold graphs
by: Csikvári, Péter, et al.
Published: (2024)
by: Csikvári, Péter, et al.
Published: (2024)
Multispreads
by: Krotov, Denis S., et al.
Published: (2023)
by: Krotov, Denis S., et al.
Published: (2023)
Toughness in regular graphs from eigenvalues
by: Liu, Ruifang, et al.
Published: (2025)
by: Liu, Ruifang, et al.
Published: (2025)
Some results on Hamming graphs and an extended Hamming graphs
by: Zafari, Ali, et al.
Published: (2025)
by: Zafari, Ali, et al.
Published: (2025)
Linear and group identifying codes in Hamming Graphs
by: Shinde, N. V., et al.
Published: (2026)
by: Shinde, N. V., et al.
Published: (2026)
Limited-visibility Cops and Robbers on Hamming graphs
by: Jones, John, et al.
Published: (2025)
by: Jones, John, et al.
Published: (2025)
On the weak $k$-metric dimension of Hamming graphs
by: Fernandez, Elena, et al.
Published: (2025)
by: Fernandez, Elena, et al.
Published: (2025)
Span capacities of graphs
by: Grašič, Mateja, et al.
Published: (2026)
by: Grašič, Mateja, et al.
Published: (2026)
Ricci curvature, diameter and eigenvalues of amply regular graphs
by: Chen, Kaizhe, et al.
Published: (2024)
by: Chen, Kaizhe, et al.
Published: (2024)
Vertices of the polytope of polystochastic matrices and product constructions
by: Taranenko, Anna A.
Published: (2023)
by: Taranenko, Anna A.
Published: (2023)
Multidimensional quadrangle condition and cuboctahedra in latin hypercubes
by: Taranenko, Anna A.
Published: (2025)
by: Taranenko, Anna A.
Published: (2025)
A graph for which the second largest distance eigenvalue is less than $\frac{-3+\sqrt{5}}{2}$ is chordal
by: Guo, Haiyan, et al.
Published: (2023)
by: Guo, Haiyan, et al.
Published: (2023)
On the quantum chromatic number of Hamming and generalized Hadamard graphs
by: Cao, Xiwang, et al.
Published: (2025)
by: Cao, Xiwang, et al.
Published: (2025)
When do graph covers preserve the clique dynamics of infinite graphs?
by: Limbach, Anna M., et al.
Published: (2025)
by: Limbach, Anna M., et al.
Published: (2025)
Aα-spectral radius and path-factor covered graphs
by: Zhou, Sizhong, et al.
Published: (2024)
by: Zhou, Sizhong, et al.
Published: (2024)
Non-geometric distance-regular graphs of diameter at least $3$ with smallest eigenvalue at least $-3$
by: Koolen, Jack, et al.
Published: (2023)
by: Koolen, Jack, et al.
Published: (2023)
Similar Items
-
On strong nodal domains for eigenfunctions of Hamming graphs
by: Valyuzhenich, Alexandr, et al.
Published: (2025) -
On extended perfect codes
by: Vorob'ev, Konstantin
Published: (2024) -
On binary codes with distances $d$ and $d+2$
by: Landjev, Ivan, et al.
Published: (2024) -
Completely regular codes in graphs covered by a Hamming graph
by: Goryainov, Sergey, et al.
Published: (2024) -
An upper bound on the size of a code with $s$ distances
by: Landjev, Ivan, et al.
Published: (2025)