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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
