2006•Designs Codes and CryptographyRequires access
Distance-transitive dihedrants
Štefko Miklavič, Primož Potočnik
Open publisher page 1 citations
Abstract
This record does not include an abstract. Use the full-text link above if available.
Štefko Miklavič, Primož Potočnik
Abstract
An abstract is not available in the OpenAlex record for this paper.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Key concepts: Combinatorics, Mathematics, Vertex-transitive graph, Cayley graph, Dihedral group, Discrete mathematics, Edge-transitive graph, Bipartite graph