Pages that link to "Item:Q3548883"
From MaRDI portal
The following pages link to Perfect Codes for Metrics Induced by Circulant Graphs (Q3548883):
Displaying 14 items.
- A family of efficient six-regular circulants representable as a Kronecker product (Q260026) (← links)
- Total perfect codes in Cayley graphs (Q329192) (← links)
- Perfect codes in circulant graphs (Q526235) (← links)
- Modeling hexagonal constellations with Eisenstein-Jacobi graphs (Q950704) (← links)
- Quotients of Gaussian graphs and their application to perfect codes (Q975827) (← links)
- Cyclotomic graphs and perfect codes (Q1621577) (← links)
- On efficiently total dominatable digraphs (Q1714019) (← links)
- Steganography from perfect codes on Cayley graphs over Gaussian integers, Eisenstein-Jacobi integers and Lipschitz integers (Q2099160) (← links)
- Steganographic schemes from perfect codes on Cayley graphs (Q2324771) (← links)
- Efficient closed domination in digraph products (Q2424797) (← links)
- Dense bipartite circulants and their routing via rectangular twisted torus (Q2636804) (← links)
- Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes (Q2637237) (← links)
- Perfect Codes in Cayley Graphs (Q4604646) (← links)
- Subgroup Perfect Codes in Cayley Graphs (Q5128515) (← links)