R-Bell numbers for Graphs
| dc.contributor.advisor | Belaineh, Zelealem (PhD) | |
| dc.contributor.author | Gebrehanna, Birhanu | |
| dc.date.accessioned | 2018-07-12T06:45:42Z | |
| dc.date.accessioned | 2023-11-04T12:32:14Z | |
| dc.date.available | 2018-07-12T06:45:42Z | |
| dc.date.available | 2023-11-04T12:32:14Z | |
| dc.date.issued | 2014-02 | |
| dc.description.abstract | The 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 graphs | en_US |
| dc.identifier.uri | http://etd.aau.edu.et/handle/123456789/8182 | |
| dc.language.iso | en | en_US |
| dc.publisher | Addis Ababa University | en_US |
| dc.subject | The r-Bell number ^Br(G) of a simple labeled graph | en_US |
| dc.title | R-Bell numbers for Graphs | en_US |
| dc.type | Thesis | en_US |