A fundamental concept in the study of Markov chains and voting protocols is the notion of consensus. Therefore in this work, we answered two main questions which are the winning probability and the consensus time (expected number of rounds to win). We applied voting protocols on finite graphs since graphs are simple models of the environment in which individual entities interact. In these processes vertices of a given graph have opinions such that by interacting with neighbors they change their opinions. And we say that a process reaches consensus if all vertices reach the state where they share the same opinion, and such opinion never changes again.