## Directed Strongly Regular Cayley Graphs over Metacyclic Groups of Order 4n

.

.

We present simple graph-theoretic characterizations of Cayley graphs for left-cancellative monoids, groups, left-quasigroups and quasigroups. We show that these characterizations are effective for the end-regular graphs of finite degree.

In 1957 Steinhaus asked for a proof that a chain of identical regular tetrahedra joined face to face cannot be closed. ´Swierczkowski gave a proof in 1959. Several other proofs are known, based on showing that the four reﬂections in planes though the origin parallel to the faces of the tetrahedron generate a group R isomorphic to the free product Z...

V magistrskemu delu se ukvarjamo z znano družino precej simetričnih grafov. To so tako imenovani Cayleyjevi grafi. V zvezi z njimi je zanimivo vprašanje o obstoju hamiltonskih poti oziroma hamiltonskih ciklov v takšnih grafih. Cayleyjevi grafi so grafi, katerih vozlišča so elementi dane grupe, povezave pa so dane s pomočjo tako imenovane povezavne ...

Published in Quantum Information Processing

The finite dihedral group generated by one rotation and one flip is the simplest case of the non-Abelian group. Cayley graphs are diagrammatic counterparts of groups. In this paper, much attention is given to the Cayley graph of the dihedral group. Considering the characteristics of the elements in the dihedral group, we conduct the model of discre...

Let G = (V, E) be a connected graph, let x ∈ V (G) be a vertex and e = yz ∈ E(G) be an edge. The distance between the vertex x and the edge e is given by d G (x, e) = min{d G (x, y), d G (x, z)}. A vertex t ∈ V (G) distinguishes two edges e, f ∈ E(G) if d G (t, e) = d G (t, f). A set R ⊆ V (G) is an edge metric generator for G if every two edges of...

We present simple graph-theoretic characterizations of Cayley graphs for left-cancellative monoids, groups, left-quasigroups and quasigroups. We show that these characterizations are effective for the end-regular graphs of finite degree.

Published in Journal of Algebraic Combinatorics

A complete classification is given of 2-distance-transitive circulants, which shows that a 2-distance-transitive circulant is a cycle, a Paley graph of prime order, a regular complete multipartite graph, or a regular complete bipartite graph of order twice an odd integer minus a 1-factor.

Applying algebraic and combinatorics techniques to solve graph problems leads to the birthof algebraic and combinatorial graph theory. This thesis deals mainly with a crossroads questbetween the two theories, that is, the problem of constructing infinite families of expandergraphs.From a combinatorial point of view, expander graphs are sparse graph...

Published in Journal of Algebraic Combinatorics

A Frobenius group is a transitive permutation group that is not regular and such that only the identity fixes more than one point. A graphical Frobenius representation (GFR) of a Frobenius group G is a graph whose automorphism group, as a group of permutations of the vertex set, is isomorphic to G. The problem of classifying which Frobenius groups ...