References
- Graphs & Digraphs G. Chartrand;L. Lesniak
- Graphical Enumeration F. Harary;E. M. Palmer
- An Introduction to Combinatorial Analysis J. Riordan
- Introduction to Graph Theory B. West
Communications of the Korean Mathematical Society (대한수학회논문집)
- Volume 16 Issue 1
- /
- Pages.67-73
- /
- 2001
- /
- 1225-1763(pISSN)
- /
- 2234-3024(eISSN)
COUNTING SELF-CONVERSE ORIENTED TREES
- Choi, Su-Jeong (Department of Mathematics, University of Soul) ;
- Lee, Chang-Woo (Department of Mathematics, University of Soul)
- Published : 2001.01.01
Abstract
We classify self-converse oriented trees into two types, namely, bicentral self-converse oriented trees and central ones, according to their centers and characterize these tow types. Using characterizations and Polya enumeration theorem, we derive the ordinary generating function for self-converse oriented trees.