Connected permutation graphs |
| |
Authors: | Youngmee Koh |
| |
Affiliation: | Department of Mathematics, University of Suwon, Kyungki-do 445-743, Korea |
| |
Abstract: | A permutation graph is a simple graph associated with a permutation. Let cn be the number of connected permutation graphs on n vertices. Then the sequence {cn} satisfies an interesting recurrence relation such that it provides partitions of n! as . We also see that, if uniformly chosen at random, asymptotically almost all permutation graphs are connected. |
| |
Keywords: | 05C30 |
本文献已被 ScienceDirect 等数据库收录! |
|