The Problems of Rankings on Sierpinski graphs
碩士 === 國立暨南國際大學 === 資訊工程學系 === 98 === For a graph G = (V;E), a vertex (edge, respectively) t-ranking is a coloring c : V ! f1; 2; : : : ; tg (c0 : E ! f1; 2; : : : ; tg, respectively) such that, for any two vertices u and v (edges ex and ey, respectively) with c(u) = c(v) (c0(ex) = c0(ey), respectiv...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/17491090115707804237 |