Source: wikibot/symmetric-graph
= Symmetric graph
{wiki=Symmetric_graph}
A symmetric graph is a type of graph that exhibits a certain level of symmetry in its structure. More formally, a graph \\( G \\) is considered symmetric if, for any two vertices \\( u \\) and \\( v \\) in \\( G \\), there is an automorphism of the graph that maps \\( u \\) to \\( v \\).