On the Incidence Ranking of Paths, Cycles and Grids
碩士 === 國立臺北商業技術學院 === 資訊與決策科學研究所 === 102 === Let G be a graph with vertex set V(G) and edge set E(G), respectively. We denote by I(G)={(v,e): v Belong V(G),e Belong E(G)and v is an end-vertex of e} the set of incidences of G and investigate the following graph labeling problem. An incidence ranking...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/67443606161910186480 |