The Far Side of the L(2,1)-labelling
碩士 === 逢甲大學 === 應用數學研究所 === 83 === Griggs 與Yeh 在一九九0年首先對簡單圖形(simple graphs)提出L(2 ,1)-labelling 的問題。若我們給定一個正數d,令G=(V,E)為一個簡單圖 形,L(2d,d)-labelling為一個非負實值函數f:v→[0,∞]使得在圖形中相 鄰的兩點x,y,其函數值差不小於 2d即|f(x)-f(y)|不小於2d,而若是x,y 距離為2時,則其函數值...
Main Authors: | Hsieh,Hung Cheng, 謝宏政 |
---|---|
Other Authors: | Yeh,Roger K. |
Format: | Others |
Language: | zh-TW |
Published: |
1995
|
Online Access: | http://ndltd.ncl.edu.tw/handle/36140301491660182501 |
Similar Items
-
L(2,1)-labeling and List-L(2,1)-labeling of Corona of Two Graphs
by: Hsing-Ju Tsai, et al.
Published: (2006) -
The L(2,1)-Labeling Problem on Block Graphs
by: Chin-Cheng LIN, et al.
Published: (2003) -
the edge span of the L(2,1)-labelling
by: Li, Jong-Shii, et al.
Published: (1997) -
L(2,1)—labeling of the bracelet graph
by: Haiping LI, et al.
Published: (2018-08-01) -
The Total L(2,1)-labeling of Graph
by: Yan-syu Ke, et al.
Published: (2009)