𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Counting acyclic digraphs by sources and sinks

✍ Scribed by Ira M. Gessel


Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
222 KB
Volume
160
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis


We count labeled acyclic digraphs according to the number sources, sinks, and edges.

1. Counting acyclic digraphs by sources

Let


πŸ“œ SIMILAR VOLUMES


A generalized chromatic polynomial, acyc
✍ J. Rodriguez; A. Satyanarayana πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 753 KB

Suppose G =(V, E) is a graph and K, K', K" are subsets of V such that K sK'nK". We introduce and study a polynomial P(G, K, K', K"; I.) in i. This polynomial coincides with the classical chromatic polynomial P(G; 1) when K = V. The results of this paper generalize Whitney's characterizations of the

Effects of heat source/sink, radiation a
✍ Rafael Cortell Bataller πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 774 KB

This paper presents a study of the flow and heat transfer of an incompressible homogeneous second-grade fluid over a nonisothermal stretching sheet. The governing partial differential equations are converted into ordinary differential equations by a similarity transformation. The effects of viscous