Name
Abstract | ||
|---|---|---|
This paper introduces the permutation voltage graph construction, which is a generalization of Gross's ordinary voltage graph construction. It is shown that every covering of a given graph arises from some permutation voltage assignment in a symmetric group and that every regular covering (in the topological sense) arises from some ordinary voltage assignment. These results are related to graph imbedding theory. It is demonstrated that the relationship of permutation voltages to ordinary voltages is analogous to the relationship of Schreier coset graphs to Cayley graphs. |
Year | DOI | Venue |
|---|---|---|
1977 | 10.1016/0012-365X(77)90131-5 | DISCRETE MATHEMATICS |
Field | DocType | Volume |
Permutation graph,Graph automorphism,Discrete mathematics,Comparability graph,Combinatorics,Vertex-transitive graph,Line graph,Cyclic permutation,Symmetric graph,Mathematics,Voltage graph | Journal | 18 |
Issue | ISSN | Citations |
3 | 0012-365X | 107 |
PageRank | References | Authors |
110.88 | 1 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jonathan L. Gross | 1 | 458 | 268.73 |
| Thomas W. Tucker | 2 | 191 | 130.07 |