Compositions of Graphs Revisited

Details Compositions of Graphs Revisited Compositions of Graphs Revisited

2007-04-28

arxiv.org/abs/0704.3821v1

Mathematics

Combinatorics

6 pages

Scientific paper

The idea of graph compositions, which was introduced by A. Knopfmacher and M. E. Mays, generalizes both ordinary compositions of positive integers and partitions of finite sets. In their original paper they developed formulas, generating functions, and recurrence relations for composition counting functions for several families of graphs. Here we show that some of the results involving compositions of bipartite graphs can be derived more easily using exponential generating functions.

Affiliated with

Also associated with

No associations

Rating

Compositions of Graphs Revisited does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Compositions of Graphs Revisited, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compositions of Graphs Revisited will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-408800