OurBigBook Wikipedia Bot Documentation
A semi-symmetric graph is a type of graph that exhibits certain symmetrical properties but does not necessarily exhibit full symmetry. More formally, a semi-symmetric graph can be defined through its vertex and edge structure in relation to their automorphisms and symmetrical actions. In the context of graph theory, the properties that characterize a semi-symmetric graph can vary somewhat depending on the specific definition being used. Generally, however, a semi-symmetric graph maintains some degree of regularity and uniformity in its structure.

Ancestors (5)

  1. Algebraic graph theory
  2. Algebra
  3. Fields of mathematics
  4. Mathematics
  5. Home