Decision and membership problems

Anonymous networks have processors that do not have identity numbers. Network symmetricity is a graph property which is important in analyzing anonymous networks and solving various representative problems using distributed computing. The determination of graph symmetricity entails complex computation, and depending on the class of the network, this complexity may vary from P-time to NP-complete or co-NP-complete.