Belaineh, Zelealem (PhD)Gebrehanna, Birhanu2018-07-122023-11-042018-07-122023-11-042014-02http://etd.aau.edu.et/handle/123456789/8182The r-Bell number ^Br(G) of a simple labeled graph G is the number of partitions of its vertex set whose blocks are independent sets of G where the _rst r-vertices are in di_erent blocks. The number of these partitions with k blocks is the (graphical) r- Stirling number ^ Sr(G; k) of G. On this particular paper we will investigate the integer sequence of r-Bell numbers for di_erent kinds of graphsenThe r-Bell number ^Br(G) of a simple labeled graphR-Bell numbers for GraphsThesis