Rainbow connection numbers of Cartesian product of graphs
碩士 === 國立東華大學 === 應用數學系 === 100 === Given a connected graph G together with a coloring f from the edge set of G to a set of colors, where adjacent edges may be colored the same, a u-v path P in G is said to be a rainbow path if no two edges of P are colored the same. A u-v path P in G is said to be...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Published: |
2012
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/4xzvg3 |