vix.ing · top · new · best · stats · spec

Basic enumeration of graph compositions with a restricted number of components

2016/02/21 by Todd Tichenor, Tichenor, Todd
Computer Science · Mathematics · #05C38 #05C70 (primary) 05A15 #11B73 (secondary) #Advanced Combinatorial Mathematics #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #math.CO #msc:05A15 #msc:05C38 #msc:05C70 #msc:11B73

paper · pdf · doi:10.48550/arxiv.1602.06548

10 pages

arxiv created 2016/02/21 · openalex publication_date 2016/02/21 · arxiv updated 2016/02/23 · openalex created_date 2022/09/10 · openalex updated_date 2026/07/28

Abstract

The concept of graph compositions is related to several number theoretic concepts, including partitions of positive integers and the cardinality of the power set of finite sets. This paper examines graph compositions where the total number of components is restricted and illustrates a connection between graph compositions and Stirling numbers of the second kind.

Related