Simple directed trees
β Scribed by R.H. Johnson
- Book ID
- 103058194
- Publisher
- Elsevier Science
- Year
- 1976
- Tongue
- English
- Weight
- 913 KB
- Volume
- 14
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
efinition. Let G be a graph arr$ assume s, .L z, w are distinct points of V(G) such that ((A,, _J+) = XJ' and I: :, v-9) = w are in A(G) but (x, w) = SW and Tz, ,*) = Ic_ v are not isl,4(G). A DLW~~Y t to G is the replacement of XJ and tw by xw mb r_v. The a+~v ~myh so obtained is denoted by rC.
π SIMILAR VOLUMES
To every directed graph G one can associate a complex 2(G) consisting of directed subforests. This construction, suggested to us by R. Stanley, is especially important in the case of a complete double directed graph G n , where it leads to the study of some interesting representations of the symmetr