Pages that link to "Item:Q2784498"
From MaRDI portal
The following pages link to An algebraic characterization of completely regular codes in distance-regular graphs (Q2784498):
Displaying 19 items.
- Edge-distance-regular graphs are distance-regular (Q385034) (← links)
- Completely regular clique graphs (Q402941) (← links)
- On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes (Q403556) (← links)
- Extremal 1-codes in distance-regular graphs of diameter 3 (Q438900) (← links)
- Edge-distance-regular graphs (Q549255) (← links)
- Tight distance-regular graphs with respect to subsets (Q854807) (← links)
- Classification of a class of distance-regular graphs via completely regular codes (Q1262870) (← links)
- Yet another distance regular graph related to a Golay code (Q1344396) (← links)
- Spectral bounds and distance-regularity (Q1774959) (← links)
- Distance-regular graphs admitting a perfect 1-code (Q2113339) (← links)
- Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes (Q2380238) (← links)
- Combinatorial vs. algebraic characterizations of completely pseudo-regular codes (Q2380471) (← links)
- The subconstituent algebra of a strongly regular graph (Q2388446) (← links)
- A survey on the missing Moore graph (Q2418974) (← links)
- Arithmetic completely regular codes (Q2808536) (← links)
- Characterizing completely regular codes from an algebraic viewpoint (Q3001410) (← links)
- A general method to obtain the spectrum and local spectra of a graph from its regular partitions (Q3299352) (← links)
- On outindependent subgraphs of strongly regular graphs (Q5291789) (← links)
- On completely regular codes with minimum eigenvalue in geometric graphs (Q6041848) (← links)
