Next Article in Journal
Mathematical Modeling of Robotic Locomotion Systems
Previous Article in Journal
An Equivalent-Perceptional Intertemporal Choice Heuristics Model for Electric Operation Vehicle Charging Behavior
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Coverings of Graphoids: Existence Theorem and Decomposition Theorems

by
Aleksander Malnič
1,2,† and
Boris Zgrablić
3,*,†
1
Department of Mathematics and Computer Science, Faculty of Education, University of Ljubljana, Kardeljeva pl. 16, 1000 Ljubljana, Slovenia
2
Department of Mathematics, IAM, University of Primorska, Muzejski trg 2, 6000 Koper, Slovenia
3
Department of Mathematics, FAMNIT, Univerza na Primorskem, Glagoljaška 8, 6000 Koper, Slovenia
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Symmetry 2024, 16(3), 375; https://doi.org/10.3390/sym16030375
Submission received: 5 January 2024 / Revised: 23 February 2024 / Accepted: 9 March 2024 / Published: 20 March 2024
(This article belongs to the Section Mathematics)

Abstract

:
A graphoid is a mixed multigraph with multiple directed and/or undirected edges, loops, and semiedges. A covering projection of graphoids is an onto mapping between two graphoids such that at each vertex, the mapping restricts to a local bijection on incoming edges and outgoing edges. Naturally, as it appears, this definition displays unusual behaviour since the projection of the corresponding underlying graphs is not necessarily a graph covering. Yet, it is still possible to grasp such coverings algebraically in terms of the action of the fundamental monoid and combinatorially in terms of voltage assignments on arcs. In the present paper, the existence theorem is formulated and proved in terms of the action of the fundamental monoid. A more conventional formulation in terms of the weak fundamental group is possible because the action of the fundamental monoid is permutational. The standard formulation in terms of the fundamental group holds for a restricted class of coverings, called homogeneous. Further, the existence of the universal covering and the problems related to decomposing regular coverings via regular coverings are studied in detail. It is shown that with mild adjustments in the formulation, all the analogous theorems that hold in the context of graphs are still valid in this wider setting.

1. Introduction

Informally, a covering projection : X ˜ X of digraphs (directed graphs) is an onto mapping such that at each vertex, restricts to a local bijection on incoming arcs and outgoing arcs. This is the only sensible definition that extends the usual concept of a covering projection of two graphs. To build a unified theory of coverings of graphs and coverings of digraphs, it is inevitable to consider coverings of graphoids, that is, coverings of multidigraphs with multiple directed and/or undirected edges, loops, and semiedges. However, in this wider context, the above definition displays unusual behaviour in the sense that the mapping might not correspond to a topological covering of the underlying graphs. This phenomenon was explained and studied in an earlier paper [1], along with a thorough discussion of the problem of lifting automorphisms in the abstract setting in terms of the action of the fundamental monoid as well as combinatorially when reconstructing coverings in terms of voltage assignments on arcs. In that paper, graphoids were called general digraphs.
In the present paper, we go a step further. After reviewing the essential definitions and results from the above-mentioned earlier paper, which we include to make the text easier to follow, we first consider regular coverings of graphoids. Then, comes the existence theorem and an extensive treatment of decomposing projections.
The existence theorem in the context of graphoids is given in terms of the action of the fundamental monoid. A more conventional formulation in terms of a group, the so-called weak fundamental group, is possible because the action of the fundamental monoid is permutational. The standard formulation in terms of the fundamental group, as it is known in topology, holds for a restricted class of coverings, called homogeneous coverings. Finally, we consider the decomposition of coverings, particularly the decomposition of regular coverings of graphoids. It is shown that with mild adjustments, all theorems regarding decomposing regular coverings of graphs are still valid in this wider setting. The results of the present paper were presented by the first author at the Bled conference in 2019.
In Graph Theory, covering space techniques appeared in the early seventies with the works of Biggs [2], Djoković [3], Gross [4], and Ezzel [5]. In the next decade, further developments took place (see, for instance, Biggs [6] and Škoviera [7]), which culminated with the appearance of the monograph by Gross and Tucker [8]. From a long list of authors who in the past 30 years used covering techniques in studying symmetries of graphs we mention Archdeacon, Brodnik, Conder, Du, Feng, Gramlich, Gvozdjak, Hofmann, Hofmeister, Jones, Kuzman, Kwak, Li, Ma, Malnič, Marušič, Neeb, Nedela, Potočnik, Požar, Sato, Šiřán, Šparl, Venkatesh, Waller, Wang, Xu, and Zhu, among others. See [9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29] and the references therein.
Covers of digraphs were probably first studied by Dörfler, Harary, and Malle [30]. A different formalisation of objects that we call graphoids was recently introduced by Fiala and Seifrtová [31].

2. Preliminaries

For the benefit of the reader, we first review the essential definitions and certain results from [1], some of which are appropriately reformulated for convenience.

2.1. Graphoids

A graphoid (or a general digraph) is an ordered 4-tuple X = ( V , D , bd , 1 ) , where V X = V is a set of vertices, D X = D is a set of darts, and bd : D V × V is a function (bd stands for “border”) that assigns to each dart x D an ordered pair of (not necessarily distinct) vertices ( u , v ) , its initial vertex  beg x = u , and its terminal vertex  end x = v . Usually, we write x : u v . Finally, −1: x x 1 is a partial involution acting on a subset of darts such that beg x 1 = end x and end x 1 = beg x . A dart x : u v without an inverse is either a directed edge (a directed link) when u v , or a directed loop when u = v . A pair of inverse darts x : u v and x 1 : v u is called an undirected edge when u v , an unoriented loop when u = v and x x 1 , and a semiedge when u = v and x = x 1 . A graphoid in which every dart has an inverse is a graph, whereas when no dart has an inverse, it is a (genuine) digraph. The underlying graph  X ̲ of X is the graph obtained by adjoining a formal inverse to each dart without an inverse. The span  sp ( X ) is a digraph that has the same sets of vertices and darts as X and the same functions beg and end , while the involution −1 is the empty function. An edge in X becomes two “oppositely” directed links in sp ( X ) ; an undirected loop becomes a pair of directed loops, while a semiedge becomes a directed loop. The spanning digraph X + of preferred orientation arising from X is obtained by including in its dart set all darts from X that have no inverse, exactly one of the darts from each pair of distinct darts that are inverse of each other, and all semiedges.
Each dart x determines two arcs, x + and x , defined as traversals x + : beg x end x and x : end x beg x . Note that “opposite” arcs are distinct by definition, x + x , even if this is a semiedge. A walk W : u v of length n 1 from a vertex u to a vertex v is a sequence W = u x 1 ϵ 1 x 2 ϵ 2 x n ϵ n v , where ϵ j = ± 1 , such that for each arc x j ϵ j in the sequence, we have that
beg x 1 ϵ 1 = u , end x n ϵ n = v , and end x j ϵ j = beg x j + 1 ϵ j + 1 , for j = 1 , , n 1 ( n 2 ) .
The trivial walk at v is the walk v : = v v of length 0. Occasionally, the endvertices of a walk are omitted by only giving the sequence of arcs for simplicity. The walk W 1 = v x n ϵ n x 1 ϵ 1 u is the inverse walk to W. A walk W : v v is a closed walk at v. A graphoid is connected if for each pair of vertices u , v V , there exists a walk u v , which coincides with the connectivity of the underlying graph in the usual (topological) sense. If W 1 : u v and W 2 : v w are walks, then W 1 · W 2 = W 1 W 2 : u w is the concatenated walk obtained by juxtaposition of the two sequences (and omitting the “middle” vertex v). The set of all closed walks at some vertex v 0 (usually referred to as the “base vertex”), equipped with concatenation as the operation, forms a monoid with the involution W W 1 , called the fundamental monoid  Π ( X , v 0 ) at v 0 .
Two walks W , W : u v of the same length, W = u x 1 ϵ 1 x 2 ϵ 2 x n ϵ n v and W = u y 1 ϵ 1 y 2 ϵ 2 y n ϵ n v , are congruent, written W W , whenever for each index j = 1 , 2 , , n , we have
y j ϵ j = x j ϵ j or y j ϵ j = ( x j 1 ) ϵ j
This defines an equivalence relation. If a walk W contains a subsequence of the from x ϵ x ϵ or of the form x ϵ ( x 1 ) ϵ , which means travelling forth and back along a dart (or a dart and its inverse, if it exists), we can delete it. This is called an elementary reduction. A sequence of elementary reductions until no further reductions are possible leads to a reduced walk  red W .
Reduced walks of congruent walks are themselves congruent. In particular, any two reduced walks of a given walk are congruent. Two walks with congruent reduced walks are called homotopic. This defines an equivalence relation, with equivalence classes (the homotopy classes) denoted as [ W ] . It corresponds to the usual notion of homotopy in the underlying graph. Restricted to the fundamental monoid Π ( X , v 0 ) , the set of homotopy classes forms the fundamental group  π ( X , v 0 ) . The homotopy class 1 = [ v 0 ] is the trivial group element, and [ W ] 1 = [ W 1 ] . As X is tacitly assumed to be connected, a minimal generating set for π ( X , v 0 ) can be constructed by taking the homotopy classes of fundamental closed walks at v 0 with respect to an arbitrary spanning tree T ¯ in X. This tree is obtained by taking a spanning tree T in sp ( X ) together with the inverses of all darts from T that exist in X. The number of generators is known as the Betti number and is equal to β ( X ) = β ( X + ) = | D X + | | V X | + 1 = r ( X + ) + s ( X ) , where r ( X + ) is the number of cotree directed links and directed loops in X + , whereas s ( X ) is the number of semiedges. The group π ( X , v 0 ) is isomorphic to the free product of r ( X + ) copies of Z (corresponding to generators of infinite order) and s ( X ) copies of Z 2 (corresponding to semiedges).
Two walks W , W : u v in a connected graphoid X are weakly homotopic if the homotopic changes that transform W to W are performed exclusively by deletion and/or insertion of subwalks of the form x ϵ x ϵ . This defines an equivalence relation with equivalence classes [ W ] w called weak homotopy classes. Note that each such class contains a unique weakly reduced walk. The weak homotopy classes of closed walks at a vertex v 0 constitute the weak fundamental group  π w ( X , v 0 ) . There is a natural monoid epimorphism Π ( X , v 0 ) π w ( X , v 0 ) and a group epimorphism π w ( X , v 0 ) π ( X , v 0 ) .
Weak homotopy in a graphoid X is homotopy in the span sp ( X ) . Hence, π w ( X , v 0 ) = π ( sp ( X ) ) of a finite graphoid is finitely generated. For X connected, a minimal generating set is formed by the weak fundamental closed walks at v 0 defined by the cotree darts relative to a genuine spanning treeT in X arising from a spanning tree T in sp ( X ) . The corresponding weak Betti number is β w ( X ) = β ( sp ( X ) ) = | D X | | V X | + 1 . Observe that π w ( X , v 0 ) is a free group of rank β w ( X ) .
A homomorphism  h : Y X of graphoids maps the vertex set and the dart set of Y to the vertex set and the dart set of X, respectively, such that beg h ( y ) = h ( beg y ) , end h ( y ) = h ( end y ) , and h ( y 1 ) = h ( y ) 1 . Graphoids and their homomorphisms form a category. Injective, surjective, and bijective homomorphisms are commonly referred to as monomorphisms, epimorphisms, isomorphisms, and automorphisms.

2.2. Coverings of Graphoids

A homomorphism : X ˜ X of graphoids is a covering projection (or just a covering for short) if the following two conditions are satisfied:
(1)
The mapping is an epimorphism. It maps the set of vertices of X ˜ onto the set of vertices of X, and it maps the set of darts of X ˜ onto the set of darts of X.
(2)
For each vertex u ˜ in X ˜ , the set of darts with initial vertex u ˜ is mapped bijectively onto the set of darts with initial vertex u = ( u ˜ ) , and the set of darts with terminal vertex u ˜ is mapped bijectively onto the set of darts with terminal vertex u = ( u ˜ ) .
For a vertex v and a dart x in X, the preimage fib v = 1 ( v ) is called the vertex fibre over v (or just the fibre for short), and 1 ( x ) is the dart fibre over x. From conditions (1) and (2), it follows that there exists a bijection τ x : fib u fib v , which implies that all fibres have equal cardinality whenever X is connected; if this cardinality is n, the covering is n-fold. Additionally, each walk W : u v lifts to a unique walk W ˜ u ˜ that projects to W and starts at an arbitrarily given vertex u ˜ fib u . This is the unique walk lifting property. For convenience, we denote the terminal vertex of the walk W ˜ u ˜ as u ˜ W . This is an action, the walk action, since the trivial walks act trivially and ( u ˜ W 1 ) W 2 = u ˜ W 1 W 2 holds for all walks W 1 : u v and W 2 : v w .
Coverings of graphoids can be rather incongruent with the standard topological perception of this concept since the induced projection X ˜ ̲ X ̲ of the underlying graphs may not be a topological covering. Consider, for instance, the following trivial examples from [1].
Example 1. 
There is a covering C 4 K 2 , where C 4 denotes the directed 4-cycle and K 2 is the complete graph on two vertices. Similarly, two directed loops 2 C 1 attached at a common vertex project as a covering onto an undirected loop C 1 . As a third example, consider the covering projection C 3 s 1 from a directed 3-cycle onto the semistar s 1 with one semiedge. The induced maps of the corresponding underlying graphs C 4 K 2 , 2 C 1 C 1 , and C 3 s 1 are not covering projections. Note that C 3 s 1 illustrates the need to consider the positive and negative traversals of a semiedge as distinct entities: the positive traversal of s 1 lifts to a walk consistent with the natural orientation of C 3 , whereas the negative one lifts to a walk that goes against it.
The reason behind these anomalies is that a dart without an inverse is mapped to a dart that has an inverse. We define a covering projection : X ˜ X of graphoids as homogeneous whenever no dart in X ˜ without an inverse is mapped to a dart that has an inverse. This notion is relevant because of the fact described below.
Theorem 1. 
Let : X ˜ X be an onto homomorphism of graphoids. Then, the associated homomorphism ̲ : X ˜ ̲ X ̲ of the underlying graphs is a covering projection if and only if : X ˜ X is a homogeneous covering.
A less restrictive concept than the homogeneity of coverings is inverse consistency. A covering projection is inverse-consistent whenever two darts u ˜ v ˜ and v ˜ u ˜ in X ˜ must form a pair of inverse darts provided that they project to a pair of inverse darts in X. Note that a homogeneous covering is inverse-consistent, but the converse does not hold. Another important fact is that a composition of two covering projections is a covering projection. Moreover, the composition of inverse-consistent coverings is inverse-consistent, and the composition of homogeneous coverings is homogeneous. However, a composition of a homogeneous covering and a non-inverse-consistent one can be inverse-consistent, as illustrated by the following examples from [1].
Example 2. 
For example, the projection C 4 C 2 is homogeneous, whereas C 2 K 2 is not inverse-consistent. Yet their composition C 4 K 2 is inverse-consistent. The projection 2 K 2 K 2 of two copies of K 2 onto K 2 is a graph covering and hence homogeneous. The projection C 4 K 2 is an inverse-consistent yet non-homogeneous covering, whereas C 4 C 2 is a covering projection of genuine digraphs and hence homogeneous (see Figure 1).

2.3. Isomorphism and Equivalence of Covering Projections

We restrict our consideration to inverse-consistent coverings in the class C ( X ) of all coverings X ˜ X , where X is a given connected finite graphoid. The covering X ˜ X is connected whenever X ˜ is also connected. The reason for restricting to inverse-consistent coverings is that certain structural properties cannot be analysed algebraically in a sufficiently meaningful manner when coverings are not inverse-consistent.
Let : X ˜ X and : X ˜ X be covering projections of graphoids. A morphism of covering projections is a pair of graphoid homomorphisms α : X X and α ˜ : X ˜ X ˜ such that the following diagram is commutative: Symmetry 16 00375 i001 This is denoted as ( α , α ˜ ) : . If in the above diagram, α and α ˜ are isomorphisms, then ( α , α ˜ ) : is an isomorphism of covering projections. This is a standard concept that formalises the intuitive notion of “coverings that are structurally the same”. In particular, : X ˜ X and : X ˜ X are equivalent whenever there exists an isomorphism of the form ( id , α ˜ ) : . Observe that the set of self-equivalences  CT = { α ˜ | ( id , α ˜ ) : } forms a group, called the group of covering transformations.
In concrete cases, the essential task is to classify (connected) inverse-consistent coverings in C ( X ) up to equivalence, or possibly up to isomorphism. Also of interest is studying the symmetry properties of X ˜ in terms of the symmetry properties of X. A first step in this direction is a special case of the isomorphism problem, the problem of lifting automorphisms: Given an automorphism α : X X , is there an automorphism α ˜ : X ˜ X ˜ such that ( α , α ˜ ) : is a self-isomorphism, or an automorphism, of ?
The above questions can be studied algebraically in terms of the action of the fundamental monoid Π ( X , v 0 ) via unique walk lifting on fib v 0 , as follows.
Theorem 2. 
Let : X ˜ X be a covering projection of graphoids, where X is connected. Then, the following statements hold:
(i) 
The connected components of X ˜ are in a one-to-one correspondence with the orbits of the action of Π ( X , v 0 ) on the fibre fib v 0 through unique walk lifting. In particular, X ˜ is connected if and only if the action of Π ( X , v 0 ) is transitive.
(ii) 
Let v ˜ fib v 0 . Then, the induced monoid homomorphism : Π ( X ˜ , v ˜ ) Π ( X , v 0 ) (denoted by the same letter for simplicity) is a monomorphism, and the stabiliser of the action of Π ( X , v 0 ) ) , which consists of all those closed walks at v 0 that lift as closed walks at v ˜ , is equal to Π ( X , v 0 ) v ˜ = ( Π ( X ˜ , v ˜ ) ) .
Theorem 3. 
The inverse-consistent covering projections : X ˜ X and : X ˜ X , where X is connected, are isomorphic if and only if there exists an automorphism α : X X and a bijection τ : fib v 0 fib α ( v 0 ) such that τ ( v ˜ W ) = τ ( v ˜ ) α ( W ) holds for all closed walks at v 0 .
This defines the lifted isomorphism α ˜ on vertices (which naturally extends to darts) by the rule α ˜ ( u ˜ ) = τ ( u ˜ P ) α ( P ) 1 , where P : u v 0 is an arbitrary walk. Consequently, ( α , α ˜ ) : is an isomorphism of coverings.
Note that the above monoid actions are permutational because the representation homomorphism χ : Π ( X , v 0 ) Fun ( fib v 0 ) is, in fact, a homomorphism into the right symmetric group χ : Π ( X , v 0 ) Sym r fib v 0 . Such monoid actions have a lot in common with group actions. Also note that the induced monoid isomorphism α : Π ( X , v 0 ) Π ( X , α ( v 0 ) ) is denoted by the same letter for simplicity.
The system of “action equations”, as in Theorem 3, states that projections are isomorphic if and only if ( τ , α ) maps the action of Π ( X , v 0 ) on fib v 0 isomorphically onto the action of Π ( X , α ( v 0 ) ) on fib α ( v 0 ) . We call such an induced monoid isomorphism admissible for the respective monoid actions. Actually, this is how Theorem 3 was formulated in [1]. In particular, : X ˜ X and : X ˜ X are equivalent if and only if the actions of Π ( X , v 0 ) on fib v 0 and fib v 0 are equivalent, that is, τ ( v ˜ W ) = τ ( v ˜ ) W holds for all closed walks W at v 0 .
If the covering is connected, then by the unique walk lifting we have that the action of CT ( ) is semiregular, and each lift of an automorphism is determined by the mapping of just one vertex. Moreover, an isomorphism of actions and the lifting condition in Theorem 3 can be expressed in terms of the stabilisers of the fundamental monoids, similarly as in the context of transitive group actions.
Corollary 1. 
Let : X ˜ X and : X ˜ X be connected inverse-consistent covering projections, and let v ˜ fib v in X ˜ and u ˜ fib u in X ˜ . Then, there exists an isomorphism ( α , α ˜ ) : such that u = α ( v ) and u ˜ = α ˜ ( v ˜ ) if and only if α maps the stabiliser Π ( X , v ) v ˜ isomorphically onto the stabiliser Π ( X , u ) u ˜ . The isomorphism α ˜ is uniquely determined by α. In particular, ℘ and are equivalent if and only if Π ( X , v ) v ˜ = Π ( X , v ) u ˜ , for some v ˜ fib v and u ˜ fib v .
Theorem 3 gives a necessary and sufficient condition in terms of an infinite number of action equations. However, the corresponding system can be made finite if we replace the monoid actions with the actions of the weak fundamental groups. This can be done since the following holds.
Theorem 4. 
Along a covering projection, weak homotopy lifts, whereas homotopy lifts if and only if the covering is homogeneous.
Theorem 4 implies that if W , W : u v are weakly homotopic, then u ˜ W = u ˜ W . It follows that there is a well-defined action of the weak homotopy group π w ( X , v 0 ) on fib v 0 , which acts “in the same way” as Π ( X , v 0 ) . The above remarks immediately imply the following.
Corollary 2. 
In Theorems 2 and 3 and Corollary 1, the action of the fundamental monoid can be replaced with the action of the weak fundamental group. With homogeneous coverings, and only with homogeneous coverings, we can use the action of the fundamental group π ( X , v 0 ) instead of π w ( X , v 0 ) .
This is relevant for performing computations in concrete examples. The action equations stated in Theorem 3 can be replaced with τ ( v ˜ [ W ] w ) = τ ( v ˜ ) α ( [ W ] w ) . Again, note that α : π ( X , v 0 ) π ( X , α ( v 0 ) ) is actually the induced mapping of the weak fundamental groups, denoted by the same symbol for simplicity. To further simplify this system of equations, we only need to consider the finite number of generators of π w ( X , v 0 ) . Actually, we only need to consider the weak fundamental closed walks at v 0 . In the case of homogeneous coverings, we can use the action of the homotopy group π ( X , v 0 ) , and Theorem 3 can be reformulated as in topology.

2.4. Combinatorialisation in Terms of Voltage Actions

Let X = ( V , D , bd , 1 ) be a graphoid, and let Γ be a group that acts on a labelling set F on the right, with χ : Γ Sym r F representing the corresponding permutation. The group action is denoted as j · g , and the corresponding induced permutation is ( j ) χ g = j χ g = j · g . The group Γ is called the voltage group, whereas F is the abstract fibre.
Furthermore, let ζ : D Γ be a voltage function that assigns to each dart x D its voltage  ζ x Γ . The derived graphoid  X × Γ , ζ F has a vertex set V × F and a dart set D × F . The functions beg and end are defined by
beg ( x , j ) = ( beg x , j ) and end ( x , j ) = ( end x , j · ζ x ) .
The partial involution is defined for darts ( x , j ) for which x 1 exists and j · ζ x ζ x 1 = j . Then, ( x , j ) 1 = ( x 1 , j · ζ x ) .
Theorem 5. 
The mapping ζ : X × Γ , ζ F X , given by the projections onto the first coordinate ( u , j ) u and ( x , j ) x , is an inverse-consistent covering projection. If we require that ζ x 1 = ζ x 1 (where ζ x 1 denotes the inverse group element, not the inverse function) holds whenever x 1 exists, then the corresponding covering is homogeneous.
The mapping ζ is called the derived covering projection. Important special cases include permutation voltages (with the natural action on F = [ n ] = { 1 , 2 , , n } of the right symmetric group Γ = Sym r F ); coset voltages, also known as relative voltages (with an arbitrary group Γ acting by right multiplication on the set of right cosets F = Δ | Γ of some subgroup Δ Γ ); and regular voltages, also known as ordinary or Cayley voltages (with an arbitrary group Γ acting by right multiplication on itself).
Theorem 6. 
If we have an inverse-consistent covering projection : X ˜ X , then there exists a derived covering ζ : X × Γ , ζ F X such that the following diagram is commutative:Symmetry 16 00375 i002Furthermore, if the projection is homogeneous, then we can assume that ζ x 1 = ζ x 1 holds whenever a dart x has an inverse.
In view of Theorem 6, the symmetry properties of inverse-consistent coverings can be studied combinatorially in terms of voltages. This holds also because an automorphism has a lift along a given covering if and only if it lifts along any other equivalent covering (observe that an automorphism that lifts along a given covering might not lift along an isomorphic covering). To consider the lifting problem combinatorially, we first extend the voltage function ζ : D Γ to a function defined on walks. The voltage of a walk W, denoted as ζ ( W ) or ζ W , is defined recursively, as follows:
ζ ( u ) = 1 , ζ x + = ζ x ,       ζ x = ζ x 1 , ζ W W = ζ W ζ W .
This implies that inverse walks receive inverse voltages, ζ W 1 = ζ W 1 . Consequently, the mapping
ζ v 0 : Π ( X , v 0 ) Γ , W ζ W ,
defines a monoid homomorphism into the voltage group. Its image Γ v 0 Γ is called the local voltage group at v 0 . Moreover, since any two weakly homotopic walks have the same voltage, there is a group homomorphism ζ v 0 : π w ( X , v 0 ) Γ v 0 (denoted by the same letter for simplicity). Additionally, if the covering is homogeneous, we may assume that the voltage function satisfies ζ x 1 = ζ x 1 (whenever x 1 exists). Then, homotopic walks have the same voltage, and so there exists a group homomorphism ζ v 0 : π ( X , v 0 ) Γ v 0 (again denoted by the same letter).
The voltages of the weak fundamental closed walks at v 0 form a generating set for Γ v 0 . Let T be a genuine spanning tree, and let x 1 , x 2 , , x n be the darts not in T. Denote by W 1 , W 2 , , W n the corresponding weak fundamental closed walks defined by T and the positive arcs defined by the cotree darts. If W is a closed walk traversing (in this order) the arcs x j 1 ϵ 1 , x j 2 ϵ 2 , , x j k ϵ k not in T, then W and W j 1 W j 2 W j k are weakly homotopic and thus have the same voltage: ζ W = ζ W j 1 ζ W j 2 ζ W j k . In the case of a homogeneous covering, the local group is generated by the voltages of the fundamental closed walks at v 0 .
Theorem 7. 
A walk W : u v in X lifts along the derived covering ζ : X × Γ , ζ F X by the rule
( u , j ) W = ( v , j · ζ W ) .
The bijection F fib v 0 , defined by j ( v 0 , j ) , establishes an equivalent action of Π ( X , v 0 ) on the abstract fibre, written j W , with the operation defined as
( v 0 , j W ) = ( v 0 , j ) W .
In view of (1), we have j W = j · ζ W , and so the abstract action of Γ v 0 as a subaction of Γ is induced by the action of Π ( X , v 0 ) via unique walk lifting. Moreover, the action induced by Π ( X , v 0 ) can be substituted by the action induced by π w ( X , v 0 ) or by the action induced by π ( X , v 0 ) in case the covering is homogeneous. Consequently, all previous facts about the orbits, stabilisers, and isomorphism of covering projections are conveniently rephrased in terms of voltages, as summarised in the next two results.
Corollary 3. 
Let ζ : X × Γ , ζ F X be a covering projection, where X is connected. Then, the following statements hold:
(i) 
The connected components of the derived graphoid are in bijective correspondence with the orbits of Γ v 0 in its action on F. In particular, the covering is connected if and only if Γ v 0 acts transitively.
(ii) 
Closed walks at the vertex ( v 0 , j ) are in bijective correspondence with closed walks at v 0 whose voltages belong to the stabiliser Γ j v 0 .
Corollary 4. 
Let ζ : X × Γ , ζ F X and ζ : X × Γ , ζ F X be the derived covering projections of a connected graphoid X. Then, an automorphism α : X X lifts to an isomorphism ( α , α ˜ ) : ζ ζ if and only if there exists a bijection τ : F F that satisfies the following system of action equations:
τ ( j · ζ W ) = τ ( j ) · ζ α ( W ) ,
where W runs through the weak fundamental closed walks at v 0 (which can be replaced with fundamental closed walks when the covering is homogeneous).
Corollary 4 states that two coverings are isomorphic if the action of Γ v 0 is mapped isomorphically onto the action of Γ α ( v 0 ) by ( τ , α ) . In particular, the coverings are equivalent whenever the actions of Γ v 0 and Γ α ( v 0 ) are equivalent.
A bijection τ : F F that satisfies the finite system of “action equations” (2) describes the mapping of the base fibre α ˜ : fib v 0 fib α ( v 0 ) , ( v 0 , j ) ( α ( v 0 ) , τ ( j ) ) . By Theorem 3, this uniquely determines the action of α ˜ on other vertices. Indeed, let α ˜ : ( u , j ) ( α ( u ) , τ u ( j ) ) . If P : u v 0 is an arbitrary walk, then
τ u ( j ) = τ ( j · ζ P ) · ζ α ( P ) 1 .
The voltage functions ζ and ζ are typically taken with respect to the same voltage action of Γ = Γ on F = F . Corollaries 3 and 4 provide several specific results for different voltage actions, with permutation and regular voltage actions being the most interesting cases. For instance, when dealing with permutation voltages, the necessary and sufficient lifting condition (2) can be rewritten as a system
ζ α ( W ) = τ 1 ζ W τ
of permutation equations in Sym r [ n ] . The problem is known as the simultaneous conjugacy problem (see [10,26]).
If a connected covering is reconstructed using regular voltages, the system of action Equations (2) can be written as: τ ( ζ W ) = τ ( 1 ) ζ α ( W ) . In particular, for a covering transformation, the condition reduces to τ ( g ) = τ ( 1 ) g for g Γ . As each covering transformation is uniquely determined by the mapping of one vertex, we have CT = { id ˜ c | c Γ } , where the action of id ˜ c on the base vertex fibre is given by
id ˜ c ( v 0 , g ) = ( v 0 , v g ) .
Furthermore, id ˜ c has the same action on all fibres. Indeed, let P : u v 0 be an arbitrary walk. Since Γ v 0 = Γ , there is a closed walk W at v 0 with ζ W = ζ P . Thus, P W 1 : u v 0 has a trivial voltage. By (3), we have that τ u = τ , as required.
It is important to note that the voltage action is given by the right multiplication of Γ on itself, whereas the action of CT on the labelling set Γ is given by the left multiplication of Γ on itself. Also, in the connected case, the action of CT is semiregular on darts as well. In particular, the action on the dart fibre at u is given by id ˜ c ( x , g ) = ( x , c g ) .
An alternate method for treating isomorphisms of coverings involves replacing admissible isomorphisms α : Π ( X , v 0 ) Π ( X , α ( v 0 ) ) between monoids (weak fundamental groups, fundamental groups) with admissible isomorphisms α # v 0 : Γ v 0 Γ α ( v 0 ) between local groups, as shown on the following diagram:
Symmetry 16 00375 i003
Because the fundamental monoids act permutationally, α projects to α # v 0 if and only if α maps the algebraic kernel  Alg Ker ζ v 0 = { W Π ( X , v 0 ) | ζ W = 1 } isomorphically onto Alg Ker ζ v 0 . Since we are tacitly assuming that the base graphoids are finite, the above condition can be expressed by requiring that the following implication
ζ W = 1 ζ α ( W ) = 1
holds for all closed walks at v 0 (actually, for all weak homotopy classes of walks at v 0 , which can be replaced with the homotopy classes of walks whenever the covering is homogeneous). For simplicity, we state the next result in terms of monoids.
Corollary 5. 
Let ζ : X × Γ , ζ F X and ζ : X × Γ , ζ F X be the derived covering projections of a connected graphoid X. Further, let α : X X be an automorphism. Then the following statements hold:
(i) 
Suppose that α : Π ( X , v 0 ) Π ( X , α ( v 0 ) ) projects to an isomorphism α # v 0 : Γ v 0 Γ α ( v 0 ) . Then, α lifts to an isomorphism of covering projections if and only if α # v 0 is admissible for the action of local groups.
(ii) 
Suppose that the local groups act faithfully. Then, α lifts to an isomorphism of covering projections if and only if α projects to an admissible isomorphism α # v 0 : Γ v 0 Γ α ( v 0 ) .
Please note the subtle difference in assumptions in (i) and (ii). In (i), we assume that α : Π ( X , v 0 ) Π ( X , α ( v 0 ) ) projects to an isomorphism, whereas in (ii), we do not need to make this assumption beforehand. Corollary 5 has several useful consequences in cases when the voltage actions or isomorphisms are of a special kind, in particular, when a connected covering is given by regular voltages [1]. Since any isomorphism between groups that act regularly is an isomorphism of actions, it follows from part (ii) of Corollary 5 that condition (5) alone is necessary and sufficient for an automorphism α of the base graphoid to lift. We summarise these remarks below.
Corollary 6. 
Let ζ : X × Γ , ζ Γ X and ζ : X × Γ , ζ Γ X be connected derived coverings by regular voltages. An automorphism α : X X lifts to an isomorphism ζ ζ if and only if for all (weak homotopy classes) of closed walks at v 0 , the following implication holds:
ζ W = 1 ζ α ( W ) = 1 .
For homogeneous coverings, it is sufficient to consider homotopy classes of closed walks at v 0 .
In particular, the coverings are equivalent if and only if ζ W = 1 ζ W = 1 holds. Alternatively, there is an isomorphism ϕ : Γ Γ between the voltage groups such that
ζ v 0 = ϕ ζ v 0 .

2.5. T-Reduced Voltages

Local groups at different vertices are conjugate subgroups of Γ . If P : u v is an arbitrary walk, then ζ P 1 W P = ζ P 1 ζ W ζ P implies Γ v = ζ P 1 Γ u ζ P . However, there is an easy way to transform a given voltage function ζ to an equivalent function ζ T , where all local groups are equal. We simply need to ensure that the voltages of closed walks at v 0 remain unchanged. To achieve this, we use a genuine spanning tree T of X. A voltage function is referred to as T-reduced if each dart in T carries the trivial voltage.
Theorem 8. 
Let ζ : X × Γ , ζ F X be a derived covering projection, and let T be a genuine spanning tree of X. Set
ζ x T = 1 x T ζ W x + x T ,
where W x + is the weak fundamental closed walk at v 0 determined by the cotree dart x in X. Then, ζ T is a T-reduced voltage function with the property that ζ W T = ζ W for each closed walk W at v 0 . Furthermore, the derived covering projection arising from ζ T is equivalent to ℘. The local group Γ v 0 remains unchanged and can be chosen as the (new) voltage group.
Proof. 
Let W be an arbitrary closed walk at a base vertex v 0 . Denote by x 1 ϵ 1 , x 2 ϵ 2 , , x n ϵ n the arcs not in T that are traversed (in this order) by W, and let W 1 , W 2 , , W n be the respective weak fundamental closed walks determined by the above cotree darts. Then, ζ W = ζ W 1 ζ W 2 ζ W n . The voltage function ζ T is T-reduced by construction, and ζ W T = ζ T ( x 1 ϵ 1 ) ζ T ( x 2 ϵ 2 ) ζ T ( x n ϵ n ) since the subwalks of W that belong to T have trivial ζ T -voltage. As ζ T ( x j ϵ ) = ζ W j by definition, we have ζ W T = ζ W . Thus, the actions of π w ( X , v 0 ) on F via unique walk lifting with respect to ζ and ζ T are the same:
j T W = j · ζ W T = j · ζ W = j W .
Consequently, the derived projection arising from ζ T is equivalent to by Theorem 3. The last claim stated in the corollary is obvious. □

3. Regular Coverings

3.1. The Concept

If one is to single out a particularly nice class of covering projections, the choice is to focus on regular coverings. Their importance is justified not only because they are the easiest to deal with but also because they play such a vital role in analysing the symmetry properties of covering (di)graphs in terms of the symmetry properties of smaller base (di)graphs. This broadens their significance in the study of graphoids as well.
An inverse-consistent covering projection : X ˜ X of graphoids, where X is connected, is considered to be regular if the fundamental monoid Π ( X , v 0 ) acts with all stabilisers being equal. The common stabiliser is denoted as Stab Π ( X , v 0 ) for convenience. Coverings that do not meet this criterion are called irregular.
It is important to note that a regular covering is inverse-consistent by definition. Although the stabilisers of Π ( X , v 0 ) can be all equal even if the projection is not inverse-consistent, the structural properties of the covering can only be studied combinatorially in terms of voltages if the covering is inverse-consistent. This is because the action of Π ( X , v 0 ) on the vertex set cannot generally differentiate between a pair of inverse and non-inverse darts projecting to a pair of inverse darts.
Example 3. 
A typical example of a regular covering is taking the quotient projection q H : Y Y / H by the action of a semiregular group H Aut Y of automorphisms of the graphoid Y. By a semiregular action, we mean that the identity is the only automorphism in H fixing a vertex (and hence a dart). The quotient graphoid is obtained by collapsing the vertex- and the dart-orbits and defining the functions beg and end in the quotient in a natural way. Observe that CT q H = H . Note that such a projection is homogeneous. However, a regular covering need not be homogeneous.
Observe that if the covering is regular and disconnected, then all connected components are isomorphic. This follows from Corollary 1 since for any pair of components of the covering, there is a lift of the identity automorphism that takes one component isomorphically to the other. Also, from the definition, it follows that a covering is regular if and only if for each closed walk W Π ( X , v 0 ) , its lifted walks are either all closed or all open. Yet another characterisation of regular coverings that is most convenient for the computations in concrete cases is given in Theorem 9.
Theorem 9. 
An inverse-consistent covering projection is regular if and only if it can be reconstructed by regular voltages. Additionally, such a covering is homogeneous if and only if the regular voltages satisfy ζ x 1 = ζ x 1 whenever the dart x has an inverse.
Proof. 
Suppose that a covering projection : X ˜ X is equivalent to a derived covering ζ : X × Γ , ζ F X , where the voltage group Γ acts regularly on F. Then, Γ v 0 acts semiregularly on F. By Corollary 3, a closed walk at v 0 lifts as a closed walk at ( v 0 , j ) if and only if it has a trivial voltage. But then it lifts as a closed walk at all vertices in the fibre. Hence, Π ( X , v 0 ) acts with all stabilisers being equal, and the covering projection is regular by definition. □
For the converse, let : X ˜ X be a regular covering, and let ζ : X × ζ F X be a derived covering by permutation voltages that reconstructs . By Theorem 8, we may assume that the voltage function is T-reduced. In this case, all local groups are equal to the image Im χ of the representation homomorphism χ : Π ( X , v 0 ) Sym r F , and Im χ can be taken as the new voltage group. Now, let us consider two cases.
If the covering is connected, then Π ( X , v 0 ) acts transitively with a common stabiliser for all vertices, forcing the voltage group Im χ to act regularly on F. Hence, Im χ appropriately reconstructs the covering. Moreover, we may take an isomorphic regular action of an abstract group Γ Im χ on itself by right multiplication. By selecting an arbitrary vertex of reference in each fibre and relabelling the fibres by the elements of Γ using the above regular action, we may reconstruct the covering in terms of the regular action of Γ on itself by right multiplication.
In addition, we need to consider the case when the covering graphoid has k 2 connected components, say, C 1 , C 2 , , C k . By the first part above, each of them can be reconstructed by a regular voltage action. Let ζ i : D Δ i denote the voltage function on the dart set of X that reconstructs the component C i . Additionally, since the components are pairwise isomorphic under the action of CT , we can choose the same voltage group and the same voltage function ζ : D Δ for all components. So, each component is identified with X × ζ , Δ Δ . The whole covering graphoid is then reconstructed by taking the voltage group Γ = Δ × Z k , which acts regularly on itself by ( a , i ) · ( g , j ) = ( a g , i + j ) . Hence, Δ × 0 preserves each component C i , whereas 1 × Z k induces a cyclic permutation ( C 1 , C 2 , , C k ) . The voltage function is defined by the rule δ x = ( ζ x , 0 ) . Then, a dart x : u v with voltage δ x lifts as ( u , ( a , i ) ) ( v , ( a , i ) · δ x ) = ( v , ( a , i ) · ( ζ x , 0 ) ) = ( v , ( a ζ x , i ) ) . Hence, each component is correctly reconstructed.
If invertible darts receive inverse voltages, then the covering is homogeneous. Conversely, if a covering is homogeneous, then the walk x + ( x 1 ) + must be lifted to a contractible walk. Hence, in the case of regular voltages, the voltage ζ x ζ x 1 has a fixed point, and so ζ x 1 = ζ x 1 .
Let us assume that the covering is connected. Then, the necessary and sufficient condition for a connected covering to be regular can be expressed in a variety of ways.
Corollary 7. 
An inverse-consistent covering projection : X ˜ X of connected graphoids is regular if and only if one of the following equivalent conditions is satisfied:
1. 
Π ( X , v 0 ) acts transitively with all stabilisers being equal.
2. 
The lifts of any closed walk are either all closed or all open.
3. 
The image Im χ v 0 of the representation homomorphism is a regular subgroup of Sym r fib v 0 .
4. 
The group π w ( X , v 0 ) acts transitively with a normal stabiliser, denoted as Stab π w ( X , v 0 ) , or, in the case of homogeneous coverings, π ( X , v 0 ) acts transitively with a normal stabiliser, denoted as Stab π ( X , v 0 ) .
5. 
The covering can be reconstructed in terms of regular voltages.
6. 
CT acts transitively (and hence regularly) on each vertex fibre.
7. 
The homomorphism X ˜ / CT X is a 1-fold covering (see the diagram below).
Symmetry 16 00375 i004
Proof. 
Item (1) is simply the definition of a regular covering combined with the fact that the covering is connected (see Theorem 2), whereas (2) is a simple reformulation of (1). Item (3) follows from (1) combined with the fact that the kernel of the action is the intersection of the stabilisers. Item (4) is a consequence of (1) since π w ( X , v 0 ) and π ( X , v 0 ) are quotient groups of Π ( X , v 0 ) , and all stabilisers form a conjugacy class of subgroups. Item (5) corresponds to Theorem 9.
Let us consider item (6). First, suppose that a connected covering : X ˜ X is regular, and let u ˜ , u ˜ fib u be arbitrary vertices. Since Π ( X , u ) u ˜ = Π ( X , u ) u ˜ , by Corollary 1, we have that there is a lift of the identity automorphism taking u ˜ to u ˜ . Therefore, CT acts transitively. Connectivity and the unique walk lifting trivially imply that CT acts without fixed points. Consequently, CT acts regularly on fib u . Conversely, let be a connected inverse-consistent covering such that there is a covering transformation α ˜ CT mapping u ˜ to u ˜ . By Corollary 1, we have that Π ( X , u ) u ˜ = Π ( X , u ) u ˜ . Thus, the stabilisers of all vertices in fib u are equal. By definition, is regular.
In order to prove item (7), observe that with any covering : X ˜ X of connected graphoids, we may form the quotient projection X ˜ X ˜ / CT since CT acts semiregularly. This is a homogeneous regular covering with the group of covering transformations equal to CT (see Example 3). Now, if : X ˜ X is regular, then the vertex sets and the dart sets of X and X ˜ / CT correspond bijectively. However, the graphoids X and X ˜ / CT need not be isomorphic since need not be homogeneous. In fact, X ˜ / CT X is a 1-fold covering. Conversely, if X ˜ / CT X is a 1-fold covering, then CT acts transitively on each fibre in X ˜ , implying that is regular. □
Remark 1. 
Regarding item 6 above, observe that CT also acts regularly on each dart fibre. Note, however, that a group acting semi(regularly) on the set of darts need not act (semi)regularly on the set of vertices. Quotienting by such an action may not result in a covering projection.
Example 4. 
As the next example shows, two non-isomorphic covering projections , : X ˜ X , a regular and an irregular one, may involve the same pair of graphs.
Let Y be a digraph on four vertices A, B, C, and D, informally described as consisting of a directed cycle A B C D A , two directed 2-cycles A C A and B D B , and a directed loop at each vertex. These three sets of cycles represent three 2-factors. Hence, there is a homomorphism of Y onto a one-vertex digraph X with three directed loops. Each of the three 2-factors is mapped to one of the loops. This defines a regular covering projection : Y X .
But in the digraph Y, we can find yet another 2-factorisation: the first 2-factor is formed by the directed 3-cycle A B C A and the loop at D, the second one is formed by the directed 3-cycle A C D A and the loop at B, whereas the third one comprises both directed loops at A and C, as well as the directed 2-cycle B D B . Thus, the mapping of these three factors onto the digraph X gives rise to a covering projection that is evidently not regular. The only non-identity automorphism that preserves this 2-factorisation is the identity mapping. Thus, the group of covering transformations is trivial.

3.2. Lifting Automorphism Groups along Regular Coverings

Studying the symmetry properties of the covering graphoid in terms of the symmetries of the base graphoid is particularly relevant when a given covering is connected and regular. Typically, such a situation is encountered when taking a quotient by a semiregular group of automorphisms, which, as we have already mentioned, is a homogeneous regular covering. In this context, we do not lift only individual automorphisms. We lift groups of automorphisms.
A group G Aut ( X )  lifts along : X ˜ X if each automorphism from G has a lift. The respective covering is called G-admissible. The collection G ˜ of all lifts of all α G constitutes a group. This is the largest group in Aut ( X ˜ ) that projects along to G. By the remarks following Theorem 6, the lifting problem can be studied in terms of voltages. The basic lifting lemma trivially implies the following corollary.
Corollary 8. 
Let ζ : X × Γ , ζ Γ X be a connected derived covering by regular voltages. Then, a group G Aut ( X ) lifts along ζ if and only if the set of closed walks with trivial voltage { W | ζ W = 1 } is invariant under the action of G.
Let a group G Aut ( X ) lift along : X ˜ X . Then there is an associated group epimorphism * : G ˜ G defined by α ˜ α . Its kernel is precisely CT = id ˜ , the group of covering transformations. Thus, the set of lifts of a particular automorphism is a coset of CT . Along with the lifting problem, we may naturally consider the following: if a group lifts, determine the isomorphism class of the lifted group, or more precisely, study the extension CT G ˜ G . Note that if the covering projections and are equivalent, then the extensions CT G ˜ G and CT G ˜ G are isomorphic. This allows us to study this extension combinatorially in terms of voltages. For the relevant results in the context of graphs, see [23,24,25].
The following proposition is one of the most basic results when comparing the symmetry properties of the covering graphoid and the base graphoid. It was initiated by Djokovič [3], who proved that along regular covers of graphs, s-transitive groups lift to s-transitive groups.
Proposition 1. 
Let : X ˜ X be a connected regular covering projection, and let a group G ˜ Aut ( X ˜ ) be the lift of a group G Aut ( X ) . Then, for the actions of G and G ˜ on the respective vertex sets, the following statements hold:
(i) 
G ˜ is transitive if and only if G is transitive.
(ii) 
G ˜ is semiregular if and only if G is semiregular.
(iii) 
In particular, G ˜ is regular if and only if G is regular.
Proof. 
Suppose that G ˜ acts transitively, and let u and v be arbitrary vertices in X. For an arbitrary pair of vertices u ˜ fib u and v ˜ fib v , there exists α ˜ G ˜ mapping u ˜ to v ˜ . But then the corresponding projection α G maps u to v. Hence, G is transitive on the vertex set of X. Note that in this direction, we do not need the assumption that the covering is regular. For the converse, however, we do. Suppose that G acts transitively on the vertex set of X, and let u ˜ fib u and v ˜ fib v be arbitrary vertices in X ˜ . Then, there exists α G taking u to v, and there is a lift α ˜ mapping u ˜ to some vertex in fib v . But all lifts of α form a coset α ˜ CT p . Because is assumed to be regular, CT p acts transitively on each fibre, which implies that some lift of α takes u ˜ to v ˜ . Thus, G ˜ acts transitively on the vertex set of X ˜ . This proves (i).
Suppose now that G acts semiregularly on the vertex set of X, and let some α ˜ G ˜ fix a vertex u ˜ fib u . Then, the corresponding projection α must fix the vertex u, which implies that α = id . Consequently, α ˜ CT p . As CT acts semiregularly, we have α ˜ = id . Hence, G ˜ acts semiregularly on the vertex set of X ˜ . Again, note that in this direction, the assumption about the regularity of the covering is not needed. As for proving the converse, let G ˜ act semiregularly on the vertex set of X ˜ , and suppose that some α G fixes a vertex α ( u ) = u . Let α ˜ be an arbitrary lift and u ˜ fib u be an arbitrary vertex. If α ˜ ( u ˜ ) u ˜ , then, since CT p acts transitively on fib u as the covering is assumed to be regular, there exists a lift α ˜ α ˜ CT p fixing u ˜ . By assumption, α ˜ = id , which implies that α = id . Hence, G acts semiregularly on the vertex set of X, as required. This proves (ii).
Claim (iii) is an obvious consequence of (i) and (ii). □

4. Existence Theorem

According to Theorem 3, two inverse-consistent covering projections X ˜ X and X ˜ X are equivalent if and only if the actions of the fundamental monoid Π ( X , v 0 ) on fib b and fib b are equivalent. However, it remains uncertain whether an arbitrarily given abstract permutational action of Π ( X , v 0 ) on a set F actually determines a covering up to equivalence such that the action of Π ( X , v 0 ) via unique walk lifting is equivalent to a given abstract action of Π ( X , v 0 ) on F. Unfortunately, in general, this is not the case. To support this claim, consider the following example.
Example 5. 
Let X be a genuine digraph on two vertices u and v with only one dart x, where b e g x = u and end x = v . The shortest nontrivial closed walk at u is W = x + x . This walk generates the fundamental monoid Π ( X , u ) , and since W = W , we have Π ( X , u ) = { u , W , W 2 , W 3 , } . An action of Π ( X , u ) is defined by specifying the action of W. For instance, let Π ( X , u ) act on F = { 0 , 1 } by 0 W = 1 and 1 W = 0 . This action is permutational, but it cannot be realised via unique walk lifting on any covering digraph as W should act trivially.
What goes wrong in the above example is that weakly homotopic walks do not act in the same way. It transpires that for an abstract action of Π ( X , v 0 ) to be realisable, it is sufficient to require that closed walks in Π ( X , v 0 ) must have the same action provided they are homotopic within a fixed chosen genuine spanning tree. This is the content of the next theorem.
Theorem 10 
(Existence theorem for covering projections). Consider a connected graphoid X with a fundamental monoid Π ( X , v 0 ) that acts permutationally and transitively on an abstract set F. Suppose this action is such that any two closed walks W and W in Π ( X , v 0 ) have the same action provided they are homotopic within a genuine spanning tree T in X.
Under these conditions, there exists an inverse-consistent covering Γ , ζ : X × Γ , ζ F X , up to equivalence, such that the action of Π ( X , v 0 ) on the fibre of v 0 via unique walk lifting is equivalent to the given abstract action of Π ( X , v 0 ) on F. To construct this required covering, we take an arbitrary epimorphism q : Π ( X , v 0 ) Γ , along with the naturally induced action of Γ (which exists) and a T-reduced voltage function given by:
ζ x = 1 x T q ( W x + ) x T .
Proof. 
Let χ : Π ( X , v 0 ) Sym r F be the representation homomorphism for the given abstract action j * W of Π ( X , v 0 ) on F, and let q : Π ( X , v 0 ) Γ be an epimorphism onto a finite group Γ such that Γ inherits the action of Π ( X , v 0 ) . Such a group Γ exists; if nothing else, it is Im χ . The induced action of Γ is given by
j · q ( W ) = j * W .
Choosing a genuine spanning tree T in X, let us define a T-reduced voltage function ζ valued in Γ as follows:
ζ x = 1 x T q ( W x + ) x T .
This defines an inverse-consistent derived covering projection X ˜ = X × Γ , ζ F X . Let W 1 , W 2 , , W n be the corresponding submonoid in Π ( X , v 0 ) generated by the fundamental closed walks at v 0 defined by the cotree darts of T. Clearly, any walk W Π ( X , v 0 ) is homotopic within T to a closed walk W ¯ W 1 , W 2 , , W n . Denote by j W the action of Π ( X , v 0 ) on F via unique walk lifting. Then,
j W = j · ζ W = j · ζ W ¯ = j · q ( W ¯ ) = j * W ¯ = j * W
.
The first equality holds due to unique walk lifting. The second equality holds since W is homotopic within T to W ¯ . The third equality holds because from the definition of ζ , it follows that q and ζ coincide on the submonoid W 1 , W 2 , , W n . (However, ζ and q need not coincide on the whole of Π ( X , v 0 ) (see Example 6). The fourth equality holds because the action of Γ is induced by the abstract action of Π ( X , v 0 ) . Finally, the last equality holds because of the assumption that the walks that are homotopic within T have the same abstract action on F.
We conclude that j W = j * W , and so the action of Π ( X , v 0 ) via unique walk lifting is equivalent to the given abstract action of Π ( X , v 0 ) on F. □
Example 6. 
This example shows that ζ and q, as in Theorem 10, need not coincide on the whole of Π ( X , v 0 ) . Let X be a genuine dumbell digraph on two vertices u , v and three darts x , y , z with b e g x = b e g y = end y = u and end x = b e g z = end z = v . The spanning tree T is defined by the dart x.
The fundamental monoid Π ( X , u ) is not finitely generated. With m ̲ = ( m 1 , m 2 , , m t ) and n ̲ = ( n 1 , n 2 , , n t ) , we have that
Π ( X , u ) = x + x , y + , { P m ̲ , n ̲ | m ̲ , n ̲ N t , t N + } ,
where the walk P m ̲ , n ̲ is P m ̲ , n ̲ = x + ( z + ) m 1 ( z ) n 1 ( z + ) m t ( z ) n t x . Define a monoid epimorphism q : Π ( X , u ) Z 2 × Z 2 by setting
x x ( 0 , 0 ) , y + ( 0 , 1 ) , P m ̲ , n ̲ ( | m ̲ | | n ̲ | , | n ̲ | ) ,
where | m | = m 1 + m 2 + m t , | n | = n 1 + n 2 + n t , and extending the definition on the generating set to the whole of Π ( X , u ) . Next, let Γ = Z 2 × Z 2 act on the set F = Z 2 by the rule k · ( i , j ) = k + i . This defines an abstract permutational action of Π ( X , u ) on F by setting
k * W = k · q ( W ) .
The above abstract action of Π ( X , u ) is such that walks, homotopic within T, have the same action. First of all, as q ( x + x ) = ( 0 , 0 ) , q ( y + ) = ( 0 , 1 ) , and q ( P m ̲ , n ̲ ) = ( | m ̲ | | n ̲ | , | n ̲ | ) , the walks x + x and y + act trivially, and k * P m ̲ , n ̲ = k + | m ̲ | | n ̲ | . Observe now that since X is a genuine digraph, π w ( X , u ) = π ( X , u ) is a free group y , x + z + x of rank 2. Moreover, two walks at u are homotopic within T if and only if they are homotopic. The walk x + x is contractible, the walk y + is homotopic to itself, whereas P m ̲ , n ̲ is homotopic to P 1 , 0 | m ̲ | | n ̲ | . The first two act trivially, whereas k * P 1 , 0 | m ̲ | | n ̲ | = k + | m ̲ | | n ̲ | . Thus, x + x , y + , and P m ̲ , n ̲ have the same abstract action as their homotopic reductions. Now, an arbitrary walk W Π ( X , u ) can be written as a product W = W 1 W 2 W s , where each W i is x + x , y + , or some P m ̲ , n ̲ . Its homotopic reduction is W ¯ = W ¯ 1 W ¯ 2 W ¯ s . Since each of the factors W i and W ¯ i have the same action, we may conclude that homotopic walks have the same action, k * W = k * W ¯ .
Let us now define a covering of X × Γ , ζ F X by taking a T-reduced voltage function, where ζ x = ( 0 , 0 ) , ζ y = ( 0 , 1 ) , and ζ z = ( 1 , 0 ) . The action of Π ( X , u ) via unique walk lifting is given by
k W = k · ζ W .
A closed walk W Π ( X , u ) is homotopic to a walk W ¯ from the submonoid x x , y + , x + z + x . Thus, ζ W = ζ W ¯ , and k W = k · ζ W ¯ . Note that q and ζ agree on the submonoid x x , y + , x + z + x since ζ x = q ( x + x ) , ζ y = q ( y + ) and ζ z = q ( x + z + x ) . Therefore, the abstract action of Π ( X , u ) and its action via unique walk lifting coincide:
k W = k · ζ W = k · ζ W ¯ = k · q ( W ¯ ) = k * W ¯ = k * W .
However, ζ ( P m ̲ , n ̲ ) q ( P m ̲ , n ̲ ) for | n ̲ | odd since ζ ( P m ̲ , n ̲ ) = ( | m ̲ | | n ̲ | , 0 ) and q ( P m ̲ , n ̲ ) = ( | m ̲ | | n ̲ | , | n ̲ | ) .
The condition imposed on the abstract action of Π ( X , v 0 ) is equivalent to the requirement that there be an abstract action of the weak homotopy group π w ( X , v 0 ) , which can be replaced with the action of the fundamental group π ( X , v 0 ) in the case of homogeneous coverings. As the coverings are required to be connected, a transitive action of π w ( X , v 0 ) or π ( X , v 0 ) is determined by a conjugacy class of stabilisers. The classic formulation of the existence theorem for covering projections is the following.
Corollary 9. 
An inverse-consistent connected covering projection is determined by a conjugacy class of subgroups in the weak homotopy group π w ( X , v 0 ) , up to equivalence. Similarly, a homogeneous covering projection is determined, up to equivalence, by a conjugacy class of subgroups in π ( X , v 0 ) .

5. Decomposition Theorems

5.1. Decomposition of Coverings and the Universal Covering

The composition of two covering projections is a covering projection. Here, we do the opposite: we would like to write a given covering : X ˜ X as a composition = q of two covering projections q : X ˜ X ˜ and : X ˜ X .
Symmetry 16 00375 i005
With and given, we say that has a decomposition via  . The following theorem resolves the problem of the existence of such a decomposition.
Theorem 11. 
Let : X ˜ X and : X ˜ X be inverse-consistent covering projections. Then, there exists a decomposition = q if and only if there exists an epimorphism of actions ( q , id ) : ( fib v 0 , Π ( X , v 0 ) ) ( fib v 0 , Π ( X , v 0 ) ) .
Proof. 
(Sketch) The proof is similar to the proof of Theorem 2.5 in [1]. If a decomposition exists, it is clear that q ( u ˜ W ) = q ( u ˜ ) W for u ˜ fib v 0 and W Π ( X , v 0 ) . Conversely, if such an action exists, we extend the mapping q : fib v 0 fib v 0 to fib v fib v by setting q ( v ˜ ) = q ( v ˜ P ) P 1 , where P : v v 0 . One shows that this mapping is well defined, extends to darts, and is consistent with the involution −1. Further details can be found in the aforementioned reference. □
If the coverings are connected, we have an analogue of Corollary 1.
Corollary 10. 
Let : X ˜ X and : X ˜ X be connected inverse-consistent covering projections. Then, there exists a decomposition = q if and only if, for an arbitrarily chosen vertex u ˜ fib v 0 , there exists v ˜ fib v 0 such that
Π ( X , v 0 ) u ˜ Π ( X , v 0 ) v ˜ .
Equivalently, π w ( X , v 0 ) u ˜ π w ( X , v 0 ) v ˜ , or π ( X , v 0 ) u ˜ π ( X , v 0 ) v ˜ in the case of homogeneous coverings.
A natural consideration arising from decomposition is the following: Given a connected graphoid X, let C C ( X ) denote a subclass of connected inverse-consistent coverings X ˜ X . A covering projection U , C : X U , C X is C -universal over X if it has a decomposition via any other covering projection : X ˜ X in C . The graphoid X U , C is called the C -universal covering graphoid. If it exists, such a covering could rightly be declared as the “largest covering” in C . It transpires that for the class of all connected inverse-consistent coverings over X, the universal covering, as it is generally known in the literature, indeed exists and is denoted simply by U : X U X . The approach to studying covering projections using universal coverings is, in some sense, dual to using voltages and has been successfully applied, particularly in topology.
In view of Theorem 11, a covering arising from the regular action of π w ( X , v 0 ) , where the stabiliser is trivial, can be factorised via any covering arising from a transitive action of π w ( X , v 0 ) . Therefore, the existence theorem guarantees that the universal covering X U X not only exists but is also determined up to equivalence. To construct the universal covering, we essentially need to “unwind” all closed walks. This is because no closed walk should lift as a closed walk, since the stabiliser of the action of the weak fundamental group would not be trivial. Similarly, there exists a universal homogeneous covering X U , X that arises from a regular action of π ( X , v 0 ) .
Theorem 12. 
Given a connected graphoid X, the universal covering projection U : X U X exists; the universal covering digraph X U is a genuine tree (which is infinite unless X is a genuine tree). For the subclass of homogeneous coverings over X, the universal covering U , : X U , X exists; the universal graphoid X U , is a tree (and infinite unless X is a tree with at most one semiedge).
Proof. 
Let Y X be the covering obtained using the construction outlined in the existence theorem for the regular action of π w ( X , v 0 ) . The weak homotopy group π w ( Y , v ˜ 0 ) , v ˜ 0 fib v 0 Y , projects isomorphically onto the stabiliser for the action of π w ( X , v 0 ) , which is trivial. Hence, π w ( Y , v ˜ 0 ) is trivial, and so Y is a genuine tree (a digraph). Next, let : X ˜ X be an arbitrary inverse-consistent covering. Then, Y X has a decomposition via by Theorem 11 because the stabiliser for the action of π w ( X , v 0 ) on fib v 0 Y is trivial and is contained in the stabiliser for the action of π w ( X , v 0 ) on fib v 0 . Thus, Y has the desired universal property. Additionally, let Y X be any covering with the universal property. Then, there exists a decomposition of Y X via Y X . Hence, Y is a covering digraph of Y and therefore isomorphic to Y since Y is a genuine tree.
The proof for the class of homogeneous coverings is similar and is left to the reader. □
Examples of universal covers of K 2 and C 2 are shown in Figure 2.

5.2. Decomposing Regular Coverings

Theorem 11 and Corollary 10 give the necessary and sufficient condition for a decomposition to exist. We would now like to consider the decomposition of regular coverings via regular coverings. However, we have a problem here since the composition of two regular covering projections need not be regular. This is the content of the following theorem.
Theorem 13. 
Let a connected covering projection : X ˜ X decompose via covering projections, as depicted in the following commutative diagram:
Symmetry 16 00375 i006
(i) 
Suppose that q and are regular coverings. Then, ℘ is regular if and only if CT lifts along q. In this case, CT is the lift of CT along q.
(ii) 
Suppose that ℘ is regular. Then, q is necessarily regular. In contrast, is regular if and only if it is inverse-consistent and CT projects along q. In this case, CT projects along q onto CT CT / CT q .
Proof. 
To prove (i), suppose that CT lifts along q. For an arbitrary α CT let α ˜ CT ˜ be any of its lifts. Then, q α ˜ = α q , and since α = , we have that α ˜ = q α ˜ = α q = q = . Thus, α ˜ CT , and so CT ˜ CT . As CT is transitive on fib v 0 , its lift CT ˜ acts transitively on q 1 ( fib v 0 ) = fib v 0 by Proposition 1. It follows that CT acts transitively and hence regularly on fib v 0 . As is inverse-consistent because q and are, is regular by Corollary 7(6).
For the converse, suppose that is regular, and let v ˜ fib v 0 in X ˜ be an arbitrarily chosen vertex. To prove that CT p lifts along q we need to see, by Corollary 1, that any α CT p maps the stabiliser of Π ( X , v ˜ ) in its action on fib v ˜ q to the stabilisers of the action of Π ( X , α ( v ˜ ) ) on fib α ( v ˜ ) q . Let W Stab Π ( X , v ˜ ) . Then, W and α ( W ) project to the same closed walk W ¯ at v 0 since = α . This means that the lifted walks of W and α ( W ) along q are the lifted walks of W ¯ along . Because is assumed to be regular, the lifts of W ¯ are either all closed or all open. In fact, they must be closed since W Stab Π ( X , v ˜ ) lifts along q as a closed walk. Thus, the lift of α ( W ) along q is also closed, and so α ( W ) belongs to Stab Π ( X , α ( v ˜ ) ) .
As for the last claim, since CT acts transitively on fib v 0 and q is regular, the lift CT ˜ acts transitively on q 1 ( fib v 0 ) = fib v 0 . As CT ˜ CT , and CT p acts regularly on fib v 0 , it follows that CT ˜ = CT . This proves (i).
To prove (ii), first note that q must be inverse-consistent since is. Let W be an arbitrary closed walk in X ˜ , and let q 1 ( W ) be the set of its lifts in X ˜ . Denote by W ¯ = ( W ) the projection of W along , which is a closed walk in X. Since = q , the set of walks q 1 ( W ) projects to W ¯ along . So, q 1 ( W ) 1 ( W ¯ ) . As is a regular covering, the walks in 1 ( W ¯ ) , and hence in q 1 ( W ) , are either all closed or all open. Thus, q is regular by Corollary 7(2). This proves the first part of (ii).
As for the second part of (ii), suppose that is regular. Since the covering q must be regular by the first part above, and since the composition = q is regular by assumption, CT lifts along q to CT by (i). Thus, CT projects along q.
Conversely, suppose that is inverse-consistent, and let CT project along q to CT ¯ . As CT is transitive on fib v 0 , the projection CT ¯ is transitive on fib v 0 . Hence, CT is transitive on fib v 0 as it contains CT ¯ . But then is regular. In this case, CT lifts to CT by (i), so CT projects onto CT . This proves the second part of (ii). □
Remark 2. 
If the composition = q of two regular covering projections is regular, then the group CT projects along q to CT , by (i) above. However, if and q are regular and CT projects along q, then = q is not necessarily regular since CT might project to a proper subgroup of CT . Below is an example.
Example 7. 
Let X be a one-vertex graph with one loop and one semiedge, and let Z be the graph on eight vertices { A , B , C , D , A , B , C , D } , informally described as an 8-cycle A B C D A B C D A with additional edges A C , B D , A C , and B D , which form a 1-factor. The mapping of the graph Z onto X, where the 8-cycle is wrapped onto the loop while the 1-factor projects onto the semiedge, is a covering projection : Z X . This covering is irregular since the only nontrivial automorphism of Z that preserves the orientation of the 8-cycle is the rotation taking A A , B B , C C , and D D . Hence, CT Z 2 . Now, let Y be the complete graph on four vertices { a , b , c , d } . The mapping of Z onto Y, taking { A , A } a { B , B } b , { C , C } c , and { D , D } d , is a regular covering q : Z Y . It wraps the 8-cycle onto the 4-cycle a b c d a and maps the 1-factor onto the 1-factor { a c , b d } . Thus, CT q = CT , and CT projects to the identity automorphism of Y. Now, mapping Y onto X by wrapping the 4-cycle a b c d a onto the loop and the 1-factor { a c , b d } onto the semiedge is a regular covering r : Y X . Obviously, CT r Z 4 . This is an example where q and r are both regular coverings, the group CT projects along q, and the covering = r q is irregular.
So far, we have considered the decomposition of regular coverings in terms of lifting and/or projecting the groups of covering transformations. As for decomposing a regular covering via a regular covering , Theorem 11 tells us that has a decomposition via if and only if
Stab Π ( X , v 0 ) Stab Π ( X , v 0 )
which can be substituted by comparing the (weak) fundamental groups. If the regular coverings are reconstructed by regular voltages, the above condition can be rephrased in a manner that has far-reaching consequences. The simplification stems from the fact that the local group is equal to the voltage group and that the voltage group and the group of covering transformations are isomorphic.
Theorem 14. 
Let ζ : X × Γ , ζ Γ X and ζ : X × Γ , ζ Γ X be connected regular derived coverings, where X = ( V , D , bd , 1 ) is a connected graphoid. Then, ζ has a decomposition via ζ if and only if any of the following equivalent conditions hold:
(i) 
There exists an epimorphism τ : Γ Γ such that ζ = τ ζ ;
(ii) 
There is a normal subgroup K Γ such that ζ is equivalent to the regular derived covering ζ Γ / K , where the voltage function ζ Γ / K : D Γ / K is defined by ζ Γ / K = ζ mod K ;
(iii) 
There is a 1-fold covering ( X × Γ , ζ Γ ) / K X × Γ , ζ Γ , where K Γ is a normal subgroup.
Proof. 
By Theorem 11, ζ has a decomposition via ζ if and only if Stab Π ( X , v 0 ) Stab Π ( X , v 0 ) . But since with regular voltages, the local group is equal to the voltage group, and the stabiliser is equal to the kernel of the local homomorphism, such a decomposition exists if and only if Ker ζ Ker ζ . This is further equivalent to requiring that there exists an epimorphism τ : Γ Γ such that the following diagram Symmetry 16 00375 i007 is commutative, which establishes equivalence with (i).
Further, the existence of an epimorphism τ : Γ Γ with ζ = τ ζ is equivalent to having an isomorphism τ ¯ : Γ / K Γ , where K = Ker τ and ζ Γ / K = q ζ = ζ mod K , such that the following diagrams Symmetry 16 00375 i008 are commutative. The derived covering ζ Γ / K is then equivalent to ζ by condition (7) of Corollary 6. This establishes equivalence between (i) and (ii).
In order to establish equivalence with (iii), suppose first that ζ has a decomposition via ζ . By (ii), we may assume that ζ is equivalent to the derived covering ζ Γ / K . Hence, ζ has a decomposition ζ = ζ Γ / K r , and the covering r is regular by (ii) of Theorem 13. Recall that CT ζ Γ and CT ( ζ Γ / K ) Γ / K . Moreover, by (ii) of Theorem 13, we also have that Γ / CT r Γ / K holds. We now show that CT r K .
First note that if q : Γ Γ / K is the quotient homomorphism, then ( q , q ) : ( Γ , Γ ) ( Γ / K , Γ / K ) is a covering between two regular right voltage actions. This is obvious since q ( a · g ) = q ( a ) · q ( g ) is exactly the equality K a g = K a · K g .
Let c g : Γ Γ , c g : a g a , be the regular action by left multiplication, which can be uniquely identified as an element of CT ζ . If q : Γ Γ / K is the quotient mapping, then there is a mapping c ¯ g : Γ / K Γ / K defined by c ¯ g q = q c g , that is, c ¯ g : a K g a K . The mapping c ¯ g can be viewed as an element of CT ζ / K , and c g c ¯ g as an epimorphism CT ζ CT ζ / K . The kernel of the homomorphism c g c ¯ g is { g Γ | g a K = a K } = K . Thus, CT r K , as claimed. By (7) of Corollary 7, it follows that taking the regular quotient by the left action of K gives a 1-fold covering ( X × Γ , ζ Γ ) / K X × Γ / K , ζ / K Γ / K , in fact, a 1-fold covering ( X × Γ , ζ Γ ) / K X × Γ , ζ Γ .
Conversely, if a 1-fold covering, as stated in (iii), exists, then ζ has a decomposition via ζ . □

5.3. Concluding Remarks

In this paper, we showed that in the context of graphoids, an arbitrary abstract action of the fundamental monoid does not determine a covering for which this action corresponds to the action of the fundamental monoid via unique walk lifting. However, up to equivalence, a covering of graphoids exists for any given abstract action of the weak fundamental group, and an action of the fundamental group determines a homogeneous covering. This extends the classical results valid for graphs and, more generally, in topology.
Also, we discussed decompositions of regular coverings by regular coverings. The next step is to consider the decomposition of G-admissible regular coverings by G-admissible regular coverings, where G is a given group of automorphisms of a fixed connected graphoid X. In general topological spaces, the problem was initiated by Venkatesh [28]. This was then used in [21] to derive a combinatorial approach in terms of voltage actions on graphs, with special emphasis on the elementary abelian coverings, where the group of covering transformations is elementary abelian. Providing non-trivial examples and constructing new interesting families of graphoids with a particular degree of symmetry is also of interest.

Author Contributions

Conceptualisation, A.M. and B.Z.; methodology, A.M. and B.Z.; validation, A.M. and B.Z.; formal analysis, A.M. and B.Z.; investigation, A.M. and B.Z.; resources, A.M. and B.Z.; data curation, A.M. and B.Z.; writing—original draft preparation, A.M. and B.Z.; writing—review and editing, A.M. and B.Z.; visualisation, A.M. and B.Z.; supervision, A.M.; project administration, B.Z.; funding acquisition, A.M. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported in part by “Ministrstvo za visoko šolstvo, znanost in tehnologijo Slovenije”, program No. P1-0285. The APC was funded by FAMNIT, Univerza na Primorskem, Glagoljaška 8, 6000 Koper, Slovenija.

Data Availability Statement

Data are contained within the article.

Conflicts of Interest

The authors declare no conflicts of interest. The funders had no role in the design of the study; in the collection, analyses, or interpretation of data; in the writing of the manuscript; or in the decision to publish the results.

References

  1. Malnič, A.; Zgrablić, B. Covers of general digraphs. Ars Math. Contemp. 2023. submitted for publication. [Google Scholar]
  2. Biggs, N.L. Algebraic Graph Theory; Cambridge University Press: Cambridge, UK, 1974. [Google Scholar]
  3. Djoković, D.Ž. Automorphisms of graphs and coverings. J. Comb. Theory Ser. B 1974, 16, 243–247. [Google Scholar] [CrossRef]
  4. Gross, J.L. Voltage graphs. Discret. Math. 1974, 9, 239–246. [Google Scholar] [CrossRef]
  5. Ezell, C.L. Observations on the construction of covers using permutation voltage assignments. Discret. Math. 1979, 28, 7–20. [Google Scholar] [CrossRef]
  6. Biggs, N.L. Homological coverings of graphs. J. Lond. Math. Soc. 1984, 30, 1–14. [Google Scholar] [CrossRef]
  7. Škoviera, M. A contribution to the theory of voltage graphs. Discret. Math. 1986, 61, 281–292. [Google Scholar] [CrossRef]
  8. Gross, J.L.; Tucker, T.W. Topological Graph Theory; Wiley–Interscience: New York, NY, USA, 1987. [Google Scholar]
  9. Archdeacon, D.; Gvozdjak, P.; Širáň, J. Constructing and forbidding automorphisms in lifted maps. Math. Slovaca 1997, 47, 113–129. [Google Scholar]
  10. Brodnik, A.; Malnič, A.; Požar, R. The simultaneous conjugacy problem in the symmetric group. Math. Comp. 2021, 90, 2977–2995. [Google Scholar] [CrossRef]
  11. Conder, M.D.E.; Ma, J. Arc-transitive abelian regular covers of cubic graphs. J. Algebra 2013, 387, 215–242. [Google Scholar] [CrossRef]
  12. Du, S.F.; Marušič, D.; Waller, A.O. On 2-arc-transitive covers of complete graphs. J. Comb. Theory Ser. B 1998, 74, 276–290. [Google Scholar] [CrossRef]
  13. Jones, G.A. Elementary abelian regular coverings of Platonic maps. Case I: Ordinary representations. J. Algebr. Comb. 2015, 41, 461–491. [Google Scholar] [CrossRef]
  14. Feng, Y.Q.; Wang, K. s-Regular cyclic coverings of the three-dimensional hypercube Q3. Eur. J. Comb. 2003, 24, 719–731. [Google Scholar] [CrossRef]
  15. Feng, Y.Q.; Kwak, J.H. s-Regular dihedral coverings of the complete graph of order 4. Chin. Ann. Math. B 2004, 25, 57–64. [Google Scholar] [CrossRef]
  16. Gramlich, R.; Hofmann, G.W.; Neeb, K.H. Semi-edges, reflections and Coxeter groups. Trans. Am. Math. Soc. 2007, 359, 3647–3668. [Google Scholar] [CrossRef]
  17. Hofmeister, M. Enumeration of concrete regular covering projections. SIAM J. Discret. Math. 1995, 8, 51–61. [Google Scholar] [CrossRef]
  18. Kuzman, B.; Malnič, A.; Potočnik, P. Tetravalent vertex-and edge-transitive graphs over doubled cycles. J. Comb. Theory Ser. B 2018, 131, 109–137. [Google Scholar] [CrossRef]
  19. Li, C.H.; Zhu, Y.Z. Covers and pseudocovers of symmetric graphs. arXiv 2022, arXiv:2210.02679v1. [Google Scholar]
  20. Malnič, A.; Nedela, R.; Škoviera, M. Lifting graph automorphisms by voltage assignments. Eur. J. Comb. 2000, 21, 927–947. [Google Scholar] [CrossRef]
  21. Malnič, A.; Marušič, D.; Potočnik, P. Elementary abelian covers of graphs. J. Algebr. Comb. 2004, 20, 71–97. [Google Scholar] [CrossRef]
  22. Potočnik, P.; Požar, R. Smallest tetravalent half-arc-transitive graphs with the vertex-stabiliser isomorphic to the dihedral group of order 8. J. Comb. Theory Ser. A 2017, 145, 172–183. [Google Scholar] [CrossRef]
  23. Požar, R. Sectional split extensions arising from lifts of groups. Ars Math. Contemp. 2013, 6, 393–408. [Google Scholar] [CrossRef]
  24. Požar, R. Testing whether the lifted group splits. Ars Math. Contemp. 2016, 11, 147–156. [Google Scholar] [CrossRef]
  25. Požar, R. Computing stable epimorphisms onto finite groups. J. Symb. Comput. 2019, 92, 22–30. [Google Scholar] [CrossRef]
  26. Požar, R. Fast computation of the centralizer of a permutation group in the symmetric group. J. Symb. Comput. 2024, 123, 102287. [Google Scholar] [CrossRef]
  27. Sato, I. Isomorphism of some graph coverings. Discret. Math. 1994, 128, 317–326. [Google Scholar] [CrossRef]
  28. Venkatesh, A. Graph Coverings and Group Liftings; preprint; Department of Mathematics, University of Western Australia: Perth, Australia, 1998. [Google Scholar]
  29. Xu, W.; Du, S.F.; Kwak, J.H.; Xu, M.Y. 2-Arc-transitive metacyclic covers of complete graphs. J. Comb. Theory Ser. B 2015, 111, 54–74. [Google Scholar] [CrossRef]
  30. Dörfler, W.; Harary, F.; Malle, G. Covers of digraphs. Math. Slovaca 1980, 30, 269–280. [Google Scholar]
  31. Fiala, J.; Seifrtová, M. A novel approach to covers of multigraphs with semiedges. Discuss. Math. Graph Theory 2024. in print. [Google Scholar] [CrossRef]
Figure 1. Coverings 2 K 2 K 2 , C 4 K 2 , and C 4 C 2 from Example 2.
Figure 1. Coverings 2 K 2 K 2 , C 4 K 2 , and C 4 C 2 from Example 2.
Symmetry 16 00375 g001
Figure 2. The homogeneous universal covering K 2 K 2 of graphs, the inverse-consistent but not homogeneous universal covering Z K 2 from the directed infinite path Z onto K 2 , and the homogeneous covering Z C 2 onto the directed 2-cycle.
Figure 2. The homogeneous universal covering K 2 K 2 of graphs, the inverse-consistent but not homogeneous universal covering Z K 2 from the directed infinite path Z onto K 2 , and the homogeneous covering Z C 2 onto the directed 2-cycle.
Symmetry 16 00375 g002
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Malnič, A.; Zgrablić, B. Coverings of Graphoids: Existence Theorem and Decomposition Theorems. Symmetry 2024, 16, 375. https://doi.org/10.3390/sym16030375

AMA Style

Malnič A, Zgrablić B. Coverings of Graphoids: Existence Theorem and Decomposition Theorems. Symmetry. 2024; 16(3):375. https://doi.org/10.3390/sym16030375

Chicago/Turabian Style

Malnič, Aleksander, and Boris Zgrablić. 2024. "Coverings of Graphoids: Existence Theorem and Decomposition Theorems" Symmetry 16, no. 3: 375. https://doi.org/10.3390/sym16030375

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop