Bell Numbers of Complete Multipartite Graphs
The {\it Stirling number} $S(G;k)$ is the number of partitions of the vertices of a graph $G$ into $k$ nonempty independent sets and the number of all partitions of $G$ is its {\it Bell number}, $B(G)$. We find $S(G;k)$ and $B(G)$ when $G$ is any complete multipartite graph, giving the upper bounds...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
2016-08-01
|
| Series: | Computer Science Journal of Moldova |
| Subjects: | |
| Online Access: | http://www.math.md/files/csjm/v24-n2/v24-n2-(pp234-242).pdf |