DOIAbstract
AbstractWe apply the theory of covering spaces to show how one can construct infinitely many finite s-transitive or locally s-transitive graphs. N. Biggs has used for similar purpose a special graph covering construction due to J. H. Conway
AbstractWe apply the theory of covering spaces to show how one can construct infinitely many finite s-transitive or locally s-transitive graphs. N. Biggs has used for similar purpose a special graph covering construction due to J. H. Conway
AbstractFor a set S of graphs, a perfect S-packing (S-factor) of a graph G is a set of mutually vert...
For a given finite connected graph Gamma, a group H of automorphisms of Gamma and a finite group A, ...
For a given finite connected graph Gamma, a group H of automorphisms of Gamma and a finite group A, ...
AbstractAny group of automorphisms of a graph G induces a notion of isomorphism between covering pro...
The homology group of a graph, with any coefficient ring, can be used to construct covering graphs. ...
We present some topics on graph covering and its generalization. We survey some results on enumerati...
Hofmeister considered the automorphism groups of antipodal graphs through the exploration of graph c...
W.T. Tutte showed that if G is an arc transitive connected cubic graph then the automorphism group o...
AbstractIn this paper we give an overview on connected locally finite transitive graphs with polynom...
A digraph (that is a directed graph) is said to be highly arc transitive if its automorphism group i...
Abstract. We give a unified approach to analysing, for each positive integer s, a class of finite co...
We define a covering of a profinite graph to be a projective limit of a system of covering maps of f...
AbstractIt is shown that, for a positive integer s, there exists an s-transitive graph of odd order ...
AbstractA hypergraph is s-arc transitive if its automorphism group acts transitively on the set of i...
AbstractA directed graph is k-arc transitive if it has an automorphism group which acts transitively...
AbstractFor a set S of graphs, a perfect S-packing (S-factor) of a graph G is a set of mutually vert...
For a given finite connected graph Gamma, a group H of automorphisms of Gamma and a finite group A, ...
For a given finite connected graph Gamma, a group H of automorphisms of Gamma and a finite group A, ...
AbstractAny group of automorphisms of a graph G induces a notion of isomorphism between covering pro...
The homology group of a graph, with any coefficient ring, can be used to construct covering graphs. ...
We present some topics on graph covering and its generalization. We survey some results on enumerati...
Hofmeister considered the automorphism groups of antipodal graphs through the exploration of graph c...
W.T. Tutte showed that if G is an arc transitive connected cubic graph then the automorphism group o...
AbstractIn this paper we give an overview on connected locally finite transitive graphs with polynom...
A digraph (that is a directed graph) is said to be highly arc transitive if its automorphism group i...
Abstract. We give a unified approach to analysing, for each positive integer s, a class of finite co...
We define a covering of a profinite graph to be a projective limit of a system of covering maps of f...
AbstractIt is shown that, for a positive integer s, there exists an s-transitive graph of odd order ...
AbstractA hypergraph is s-arc transitive if its automorphism group acts transitively on the set of i...
AbstractA directed graph is k-arc transitive if it has an automorphism group which acts transitively...
AbstractFor a set S of graphs, a perfect S-packing (S-factor) of a graph G is a set of mutually vert...
For a given finite connected graph Gamma, a group H of automorphisms of Gamma and a finite group A, ...
For a given finite connected graph Gamma, a group H of automorphisms of Gamma and a finite group A, ...
Add to ORKG