Election in Anonymous Trees
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.
We consider the case of trees. The following FCGRS (Graph Rewriting System with Forbidden Context) allows to elect a vertex in a tree (recall that a relabelling rule with forbidden contexts can be applied to some occurrence if and only if this occurrence is not included in an occurrence of some of its forbidden contexts).
