(p,1)-total labeling of complete graphs
碩士 === 國立東華大學 === 應用數學系 === 97 === Given a graph G and positive integers p, q with p≥q, the (p,q)-total number λ_(p,q)^T (G) of G is the width of the smallest range of integers that suffices to label the vertices and the edges of G such that the labels of any two adjacent vertices are at least q apa...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/39014980082815704972 |