R-Bell numbers for Graphs
No Thumbnail Available
Date
2014-02
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Addis Ababa University
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
Description
Keywords
The r-Bell number ^Br(G) of a simple labeled graph