Graph compositions are related to compositions of positive integers and partitions of finite sets, and have applications in electrical networks. This paper provides extensions of a previously known result which states that C(K N ) = B(N) B(N 2), where B(N) represents the Nth Bell number and C(K N ) is the complete graph on N vertices with one edge deleted.
展开▼
