The Interchange Graphs of Non-isomorphic Tournaments with Minimum Score Vectors Are Exactly Hypercubes
碩士 === 國立臺北商業技術學院 === 資訊與決策科學研究所 === 99 === A tournament of size n, denoted by Tn, represents the players p1,p2,...,pn in a round robin tournament and every two distinct players pi and pj compete exactly one game to decide the winner (and the loser) between them and tie is not permitted. If pi beats...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2011
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/35478602496317352048 |