Voltage graphs
From MaRDI portal
Publication:1845889
DOI10.1016/0012-365X(74)90006-5zbMATH Open0286.05106OpenAlexW2911335865MaRDI QIDQ1845889FDOQ1845889
Authors: Jonathan L. Gross 
Publication date: 1974
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(74)90006-5
Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Relations of low-dimensional topology with graph theory (57M15) Covering spaces and low-dimensional topology (57M10) Triangulating manifolds (57Q15)
Cites Work
- Title not available (Why is that?)
- SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
- Generating all graph coverings by permutation voltage assignments
- Title not available (Why is that?)
- The topological theory of current graphs
- Orientable embedding of Cayley graphs
- Branched coverings of graph imbeddings
- On the Genus of a Group
- Components of branched coverings of current graphs
- Rank numbers of grid graphs
- Quotients of complete graphs: revisiting the Heawood map-coloring problem
Cited In (61)
- Random walks, conductance, and resistance for the connection graph Laplacian
- All polytopes are coset geometries: characterizing automorphism groups of \(k\)-orbit abstract polytopes
- Hamiltonicity of covering graphs of trees
- Topological Graph Theory: A Personal Account
- Algebraic specification of interconnection network relationships by permutation voltage graph mappings
- On the Genus of Symmetric Groups
- Spanning trees in \(\mathbb{Z} \)-covers of a finite graph and Mahler measures
- On 2-arc-transitivity of Cayley graphs
- Title not available (Why is that?)
- Genus embeddings for some complete tripartite graphs
- Doubly transitive lines. I: Higman pairs and roux
- Coverings that preserve sense of direction
- Burnside chromatic polynomials of group-invariant graphs
- Modelling biplanes on surfaces
- Graph covers with two new eigenvalues
- Vertex-transitive polyhedra of higher genus. I
- The symmetric genus of metacyclic groups
- Counter machines and crystallographic structures
- Proper locally spherical hypertopes of hyperbolic type
- Sets with involutions: power group enumeration
- Signatures, lifts, and eigenvalues of graphs
- Signed graphs
- Components of branched coverings of current graphs
- Branched cyclic regular coverings over Platonic maps
- Generalised voltage graphs
- Semi-edges, reflections and Coxeter groups
- Curvature and higher order Buser inequalities for the graph connection Laplacian
- The Number of Groups of a given Genus
- Lifting graph automorphisms by voltage assignments
- Minimal crystallizations of 3-manifolds with boundary
- A contribution to the theory of voltage graphs
- Generating all graph coverings by permutation voltage assignments
- Combinatorial characterization of the null spaces of symmetric H-matrices
- On the genus of finite abelian groups
- AN ARBITRAGE INTERPRETATION OF CLASSICAL OPTIMIZATION
- Hamiltonian cycles in covering graphs of trees
- Edge-colorability of graph bundles
- Free idempotent generated semigroups: the word problem and structure via gain graphs
- Circulant graph imbeddings
- Self-dual embeddings of Cayley graphs
- Branched coverings
- Non-abelian almost totally branched coverings over the Platonic maps
- Title not available (Why is that?)
- Isomorphisms of some graph coverings
- Dual imbeddings and wrapped quasi-coverings of graphs
- Frustration index and Cheeger inequalities for discrete and continuous magnetic Laplacians
- Twofold triple systems and graph imbeddings
- The medial graph and voltage-current duality
- Voltage lifts of graphs from a category theory viewpoint
- Quotients of connected regular graphs of even degree
- Constructions and topological invariants of 2-(v,3,\(\lambda\) ) designs with group actions
- Block designs and graph imbeddings
- Observations on the construction of covers using permutation voltage assignments
- Every connected regular graph of even degree is a Schreier coset graph
- Lower bounds for regular genus and gem-complexity of PL 4-manifolds with boundary
- Velocity polytopes of periodic graphs and a no-go theorem for digital physics
- Classification of 2-arc-transitive dihedrants
- Embeddings of covering projections of graphs
- A Combinatorial Proof of the All Minors Matrix Tree Theorem
- Simplicial schemes
- On the spectra and eigenspaces of the universal adjacency matrices of arbitrary lifts of graphs
This page was built for publication: Voltage graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1845889)
