Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Is there a mathematical, graph theory, game theory term for a graph that is fully connected and balanced evenly with each other node.

I'm thinking in situations like Rock paper scissors where each action is equally balanced by each other option?

share|cite|improve this question
What you ask is not very clear. Perhaps this will help,though: – Aryabhata Jul 12 '11 at 21:33
A directed graph which is connected, and where every vertex has the same indegree and outdegree, is called Eulerian . Is that what you're looking for? – David Speyer Jul 13 '11 at 2:28

A regular tournament $T=(V,E)$ is a complete digraph on $|V|=2n+1$ vertices where each vertex has the same score as each other vertex. Each vertex is connected to each other vertex by exactly one directed edge and each vertex dominates exactly $\frac{|V|-1}{2}$ other edges and is dominated by the $\frac{|V|-1}{2}$ other edges.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.