Labeling Graphs with Two Distance-Constraints
碩士 === 國立東華大學 === 應用數學系 === 90 === Given a graph G, an L(d_{1},d_{2};p,q)-labeling of G is a function f:V(G)-->{0,1,2,...,n} such that |f(u)-f(v)|>= p if d_{G}(u,v)<= d_{1} and |f(u)-f(v)|>= q if d_{G}(u,v)<= d_{2}. A k-L(d_{1},d_{2};p,q)-labeling is an L(d_{1},d_{2};p,q)-labeling f s...
Main Authors: | Chun-Liang Lin, 林俊良 |
---|---|
Other Authors: | D.Kuo |
Format: | Others |
Language: | en_US |
Published: |
2002
|
Online Access: | http://ndltd.ncl.edu.tw/handle/38557388216266771649 |
Similar Items
-
Distance-two labelings of Hamming graphs
by: Lian-Hwao Huang, et al.
Published: (2003) -
Distance Two Labelings on Graphs
by: An-Chiang Chu, et al.
Published: (2005) -
Distance two-labelings of the corona of two graphs
by: Bo-Jr Li, et al.
Published: (2003) -
Distance-two constrained labeling and list-labeling of some graphs
by: Zhou, Haiying
Published: (2013) -
Distance two labeling on special family of graphs
by: Muthali Murugan
Published: (2015-12-01)