The Minimum Edge Ranking on Sierpinski S(n, 3) Graphs
碩士 === 國立暨南國際大學 === 資訊工程學系 === 97 === Let e be an edge in a graph G. The labeling of e, denoted by r(e), is a positive integer. An edge ranking of graph G is a labeling of edges such that every path between two different edges ei, ej with r(ei) = r(ej) contains an intermediate edge ew with r(ew) >...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/62390491754143041388 |