Decomposition of Kn into directed cycle of length n-1
碩士 === 淡江大學 === 數學學系 === 87 === A graph can be described by two sets V and E. ie. G=(V,E) if V is a nonempty set, we called V a vertex set, E is a subset of two-element subset of V, we called E an edge set. If there is exactly one edge joining any pair of vertices of V and V contains n el...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1999
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/00509938532139117326 |