On Vertex Ranking And Related Problem Of Graphs
碩士 === 國立嘉義大學 === 資訊工程學系研究所 === 97 === Given a connected graph G, a vertex ranking is a mapping C:V->{1,2,...k} such that for every path of end vertices u,v and C(u)=C(v), there is a vertex w lies on the path with C(w)>C(u)=C(v). The minimum value of k among all vertex ranking of G is called...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Language: | en_US |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/26uw9w |