Abstract:
We introduced the rebellion set for simple graphs by interchanging the inequalities
in the alliance set. In this paper, we defined the accurate rebellion set and the corresponding accurate rebellion number by posting accurate condition on the co-rebellion
sets for simple graphs. Also, we discussed its graphic theoretical properties and obtained some bounds in terms of elements of G.
in the alliance set. In this paper, we defined the accurate rebellion set and the corresponding accurate rebellion number by posting accurate condition on the co-rebellion
sets for simple graphs. Also, we discussed its graphic theoretical properties and obtained some bounds in terms of elements of G.