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
β¦ 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
95/00727 Solution of abiation and combin
π
Article
π
1995
π
Elsevier Science
β 175 KB
Solution by the method of sources and si
β
Kh.A. Rakhmatulin; G.D. Tkacheva
π
Article
π
1972
π
Elsevier Science
β 423 KB
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
Error in the absolute determination of d
β
Laurel G. Sutherland; John D. Buchanan
π
Article
π
1967
π
Elsevier Science
β 182 KB