The L(2,1)-labeling problem on ditrees

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/33742

Title:	The L(2,1)-labeling problem on ditrees
Authors:	Chang,GJ;Liaw,SC
Contributors:	數學研究所
Keywords:	DISTANCE 2 LABELINGS;GRAPHS;PATH
Date:	2003
Issue Date:	2010-07-07 11:43:23 (UTC+8)
Publisher:	中央大學
Abstract:	An L(2, 1)-labeling of a graph G is a function f from the vertex set V(G) to the set of all nonnegative integers such that \f(x)-f(y)\ greater than or equal to 2 if d(G)(x,y) =1 and \f(x)-f(y)\ greater than or equal to 1 if d(G)(x,y) = 2. The L(2, 1)-labe
Relation:	ARS COMBINATORIA
Appears in Collections:	[Graduate Institute of Mathematics] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	543	View/Open

社群 sharing