A contribution to the theory of voltage graphs

DOI10.1016/0012-365X(86)90099-3zbMath0594.05029MaRDI QIDQ1076681

Martin Škoviera

Publication date: 1986

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

symmetric groupcoveringspermutation voltage assignmentordinary voltage assignmentvoltage graph theory

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (27)

Edge-transitive regular metacyclic covers of the Petersen graph ⋮ Classifying cubic symmetric graphs of order \(10p\) or \(10p^{2}\) ⋮ On arc-transitive metacyclic covers of graphs with order twice a prime ⋮ Classifying cubic edge-transitive graphs of order \(8p\) ⋮ Group actions, coverings and lifts of automorphisms ⋮ Cubic symmetric graphs of order a small number times a prime or a prime square ⋮ Strong edge colorings of graphs and the covers of Kneser graphs ⋮ On 2-arc-transitivity of Cayley graphs ⋮ On edge-transitive metacyclic covers of cubic arc-transitive graphs of order twice a prime ⋮ CUBIC EDGE-TRANSITIVE GRAPHS OF ORDER 8p² ⋮ Efficient domination in cubic vertex-transitive graphs ⋮ Cubic edge-transitive graphs of order 2\(p^{3}\) ⋮ Constructing even radius tightly attached half-arc-transitive graphs of valency four ⋮ Lifting graph automorphisms along solvable regular covers ⋮ Arc-transitive cyclic covers of graphs with order twice a prime ⋮ Semisymmetric Zp-covers of the C20 graph ⋮ Elementary abelian covers of graphs ⋮ Non-normal one-regular and 4-valent Cayley graphs of dihedral groups \(D_{2n}\) ⋮ Edge-transitive regular \(Z_n\)-covers of the Heawood graph ⋮ Sets with involutions: power group enumeration ⋮ Cubic semisymmetric graphs of order \(6p^{3}\) ⋮ Invariant subspaces, duality, and covers of the Petersen graph ⋮ A census of semisymmetric cubic graphs on up to 768 vertices ⋮ Cubic semisymmetric graphs of order \(8p ^{3}\) ⋮ An infinite family of cubic edge- but not vertex-transitive graphs ⋮ Lifting graph automorphisms by voltage assignments ⋮ Constructing an infinite family of cubic 1-regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quotients of connected regular graphs of even degree
• Components of branched coverings of current graphs
• Genus embeddings for some complete tripartite graphs
• Every connected regular graph of even degree is a Schreier coset graph
• Generating all graph coverings by permutation voltage assignments
• Observations on the construction of covers using permutation voltage assignments
• Voltage graphs

This page was built for publication: A contribution to the theory of voltage graphs