In mathematics, an semi-symmetric Graph (mathematics) is a graph that is Edge-transitive graph, Regular graph, but not Vertex-transitive graph.

In other words, a regular graph is semi-symmetric if its automorphism group (mathematics) acts group action upon its edges but not upon its vertices.

=Examples and properties=

= See also =