DOIAbstract
AbstractA characterization is given of a class of edge-transitive Cayley graphs, providing methods for constructing Cayley graphs with certain symmetry properties. Various new half-arc transitive graphs are constructed
AbstractA characterization is given of a class of edge-transitive Cayley graphs, providing methods for constructing Cayley graphs with certain symmetry properties. Various new half-arc transitive graphs are constructed
AbstractA characterisation is given of edge-transitive Cayley graphs of valency 4 on odd number of v...
A graph $X$ is {\em symmetric} if its automorphism group acts transitively on the arcs of $X$, and {...
AbstractA graph is said to be half-arc-transitive if its automorphism group acts transitively on the...
A characterization is given of a class of edge-transitive Cayley graphs, providing methods for const...
AbstractA classification is given for connected edge-transitive tetravalent Cayley graphs of square-...
AbstractA characterization is given of a class of edge-transitive Cayley graphs, providing methods f...
AbstractBy definition, Cayley graphs are vertex-transitive, and graphs underlying regular or orienta...
AbstractA graph is half-transitive if its automorphism group acts transitively on its vertex set and...
AbstractA graph is said to be half-transitive if its automorphism group acts transitively on the ver...
A vertex-transitive graph X is said to be half-arc-transitive if its automorphism group acts transit...
Abstract. A characterisation is given of edge-transitive Cayley graphs of valency 4 on odd number of...
Abstract A graph is called edge-transitive if its full automorphism group acts transitively on its e...
The first part of this dissertation deals with highly symmetrical combinatorial structures - vertex ...
AbstractA 2-arc in a graph X is a sequence of three distinct vertices of graph X where the first two...
Let S be a set of transpositions generating the symmetric group Sn (n ≥ 5). The transposition graph ...
AbstractA characterisation is given of edge-transitive Cayley graphs of valency 4 on odd number of v...
A graph $X$ is {\em symmetric} if its automorphism group acts transitively on the arcs of $X$, and {...
AbstractA graph is said to be half-arc-transitive if its automorphism group acts transitively on the...
A characterization is given of a class of edge-transitive Cayley graphs, providing methods for const...
AbstractA classification is given for connected edge-transitive tetravalent Cayley graphs of square-...
AbstractA characterization is given of a class of edge-transitive Cayley graphs, providing methods f...
AbstractBy definition, Cayley graphs are vertex-transitive, and graphs underlying regular or orienta...
AbstractA graph is half-transitive if its automorphism group acts transitively on its vertex set and...
AbstractA graph is said to be half-transitive if its automorphism group acts transitively on the ver...
A vertex-transitive graph X is said to be half-arc-transitive if its automorphism group acts transit...
Abstract. A characterisation is given of edge-transitive Cayley graphs of valency 4 on odd number of...
Abstract A graph is called edge-transitive if its full automorphism group acts transitively on its e...
The first part of this dissertation deals with highly symmetrical combinatorial structures - vertex ...
AbstractA 2-arc in a graph X is a sequence of three distinct vertices of graph X where the first two...
Let S be a set of transpositions generating the symmetric group Sn (n ≥ 5). The transposition graph ...
AbstractA characterisation is given of edge-transitive Cayley graphs of valency 4 on odd number of v...
A graph $X$ is {\em symmetric} if its automorphism group acts transitively on the arcs of $X$, and {...
AbstractA graph is said to be half-arc-transitive if its automorphism group acts transitively on the...
Add to ORKG