Photo from wikipedia
A Cayley graph over a group G is said to be central if its connection set is a normal subset of G. It is proved that for any two central… Click to show full abstract
A Cayley graph over a group G is said to be central if its connection set is a normal subset of G. It is proved that for any two central Cayley graphs over explicitly given almost simple groups of order n, the set of all isomorphisms from the first graph onto the second can be found in time poly (n).
Keywords:
simple groups;
almost simple;
time;
cayley graphs;
central cayley
Journal Title: Journal of Mathematical Sciences
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Journal of Mathematical Sciences
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!