Some Problems on Opposition Graphs
碩士 === 國立政治大學 === 應用數學研究所 === 101 === In this thesis, we use the number of vertices with degree greater than or equal to 3 as a criterion for trees being opposition graphs. Finally, we prove some families of graphs such as Pn, Cn with n ≥ 3 and n = 4k; k ∈ N are opposition graphs and some families o...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Online Access: | http://ndltd.ncl.edu.tw/handle/99148090078386088820 |