On L(d,1)-Labeling of Cartesian product of a Cycle and a Path

碩士 === 真理大學 === 數理科學研究所 === 92 === A k-L(d,1)-labeling of a graph G is a function f from the vertex set V(G) to {0,1,⋯,k} such that |f(u)-f(v)|≥1 if d(u,v)=2 and |f(u)-f(v)|≥d if d(u,v)=1. The L(d,1)-labeling problem is to find the L(d,1)-labeling number λ(G) of a graph G which is the minimum cardin...

Full description

Bibliographic Details
Main Authors: Shih-Hu Chiang, 江詩湖
Other Authors: Jing-Ho Yan
Format: Others
Language:en_US
Published: 2004
Online Access:http://ndltd.ncl.edu.tw/handle/54511382836800798477