Search
Now showing items 1-2 of 2
Automorphism groups of graph covers and uniform subset graphs
(Taylor and Francis Group, 2018)
Hofmeister considered the automorphism groups of antipodal graphs through the exploration of graph covers. In this note weextend the exploration of automorphism groups of distance preserving graph covers. We apply the ...
Binary codes and partial permutation decoding sets from the odd graphs
(Walter de Gruyter, 2014)
For k ≥ 1, the odd graph denoted by O(k), is the graph with the vertex-set Ω{k}
, the set of all k-subsets of Ω =
{1, 2, . . . , 2k + 1}, and any two of its vertices u and v constitute an edge [u, v] if and only if u ∩ ...