Bell Numbers of Graphs
| Metadata Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Johnson, Peter | |
| dc.contributor.author | Duncan, Bryce | |
| dc.date.accessioned | 2012-05-04T20:37:41Z | |
| dc.date.available | 2012-05-04T20:37:41Z | |
| dc.date.issued | 2012-05-04 | |
| dc.identifier.uri | http://hdl.handle.net/10415/3096 | |
| dc.description.abstract | Let G be a simple graph with vertex set V (G). Let F be a family of graphs such that K1 ∈ F. Denote by B(G; F) the number of unordered partitions of V(G) such that each part induces a member of F. We call B(G; F) the Bell number of the graph G with respect to the family F. We investigate properties of this function for different families F, and conditions on F for the function B(G; F) to have certain properties. | en_US |
| dc.rights | EMBARGO_NOT_AUBURN | en_US |
| dc.subject | Mathematics and Statistics | en_US |
| dc.title | Bell Numbers of Graphs | en_US |
| dc.type | dissertation | en_US |
| dc.embargo.length | NO_RESTRICTION | en_US |
| dc.embargo.status | NOT_EMBARGOED | en_US |