Expandability of Graphs in the Distance Labeling
碩士 === 逢甲大學 === 應用數學所 === 98 === A vertex v of a graph G is said to be expandable if we can add a new vertex u to v and joining u to v and its neighbors so that the resulting graph has the same L(2,1)-labeling number as G. We seek the maximum number of expandable vertices in G, called the utility of...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/26744920900214743226 |