Pages that link to "Item:Q6041848"
From MaRDI portal
The following pages link to On completely regular codes with minimum eigenvalue in geometric graphs (Q6041848):
Displaying 7 items.
- A new infinite series of regular uniformly geodetic code graphs (Q687134) (← links)
- Completely regular designs of strength one (Q1321590) (← links)
- On the number of minimal codewords in codes generated by the adjacency matrix of a graph (Q2065789) (← links)
- An algebraic characterization of completely regular codes in distance-regular graphs (Q2784498) (← links)
- Arithmetic completely regular codes (Q2808536) (← links)
- \(L_{\infty}\) norm minimization for nowhere-zero integer eigenvectors of the block graphs of Steiner triple systems and Johnson graphs (Q6587448) (← links)
- Completely regular codes with covering radius 1 and the second eigenvalue in 3-dimensional Hamming graphs (Q6646414) (← links)