• 대한수학회논문집
• /
• 제17권2호
• /
• pp.363-370
• /
• 2002

We show that G(x) = $e^{(x}$(1-x))/ -1 is the exponential generating function for the labeled digraphs whose weak components are transitive tournaments and derive both a recursive formula and an explicit formula for the number of them on n vertices. Moreover, we investigate the asymptotic behavior for the coefficients of G(x) using Hayman's method.d.