Elementary Abelian Covers of Graphs

By Aleksander Malnic, Dragan Marusic, Primoz Potocnik. 2004

124 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/b6eb8087b7339d6e545479a8443765a595a56269

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Dragan Marusic
2. Aleksander Malnic
3. Primoz Potocnik

In Discrete Mathematics and Combinatorics

1. Dragan Marusic
2. Aleksander Malnic
3. Primoz Potocnik
4. Marston D. E. Conder

In Electrical and Electronic Engineering

1. Dragan Marusic
2. Aleksander Malnic
3. Primoz Potocnik
4. Marston D. E. Conder

Citations in the corpus

• Classifying cubic symmetric graphs of order 10p or 10p2 (2006, background): “[17] and s-regular cubic graphs admitting a solvable arc-transitive group of automorphisms in ref.”
• On Cubic Graphs Admitting an Edge-Transitive Solvable Group (2004, methodology): “Based on the theory developed in [ 14 ], the discussion above gives the following proposition.”
• A census of semisymmetric cubic graphs on up to 768 vertices (2006, background): “(For a more extensive treatment of coverings, see [23, 31 , 32] for example.)”