Election in Complete Graphs
The aim of an election in a graph is to choose exactly one vertex among the set of all vertices. This vertex becomes
elected
and is called the
leader
of the graph.
Snapshots