Pages that link to "Item:Q1844190"
From MaRDI portal
The following pages link to Perfect codes in the graphs \(O_k\) (Q1844190):
Displaying 16 items.
- Efficient domination through eigenvalues (Q317399) (← links)
- Total perfect codes in Cayley graphs (Q329192) (← links)
- Structure of squares and efficient domination in graph classes (Q338382) (← links)
- The covering radius of Hadamard codes in odd graphs (Q1199453) (← links)
- An improved version of Lloyd's theorem (Q1227561) (← links)
- Nearly perfect codes in distance-regular graphs (Q1231470) (← links)
- Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs (Q1313745) (← links)
- Weighted efficient domination problem on some perfect graphs (Q1348388) (← links)
- On subgroup perfect codes in Cayley graphs (Q2225434) (← links)
- Perfect codes in vertex-transitive graphs (Q2689009) (← links)
- Fundamentals of coding type problems (Q3637813) (← links)
- Perfect codes in the graphs <i>O<sub>k</sub></i> and <i>L(O<sub>k</sub>)</i> (Q3869391) (← links)
- Perfect Codes in Cayley Graphs (Q4604646) (← links)
- On non-normal subgroup perfect codes (Q5026992) (← links)
- Subgroup Perfect Codes in Cayley Graphs (Q5128515) (← links)
- Characterizing subgroup perfect codes by 2-subgroups (Q6048702) (← links)
