Back Graphe semi-symétrique French Félszimmetrikus gráf Hungarian 半対称グラフ Japanese Grafo semissimétrico Portuguese Полусимметричный граф Russian அரை-சமச்சீர் கோட்டுரு Tamil Напівсиметричний граф Ukrainian
In the mathematical field of graph theory, a semi-symmetric graph is an undirected graph that is edge-transitive and regular, but not vertex-transitive. In other words, a graph is semi-symmetric if each vertex has the same number of incident edges, and there is a symmetry taking any of the graph's edges to any other of its edges, but there is some pair of vertices such that no symmetry maps the first into the second.