On Finding a Rainbow Connection in a Versatile Pyramid Network
碩士 === 中國文化大學 === 資訊管理學系 === 101 === Edge coloring of a graph is a function from its edge set to the set of natural numbers. A path in an edge colored graph with no two edges sharing the same color is called a rainbow path. An edge-colored graph is rainbow connected if any two vertices are connected...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2013
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/90080836433079435170 |