| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4646885 | Discrete Mathematics | 2016 | 5 Pages |
Abstract
A graph composition is a partition of the vertex set such that each member of the partition induces a connected subgraph, and the composition number of a graph is the number of possible graph compositions. This work establishes bounds on the aforementioned parameter for certain classes of graphs and exhibits a connection between graph compositions and the Bell triangle.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Todd Tichenor,