Distance-two labelings of digraphs

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

Title:	Distance-two labelings of digraphs
Authors:	Chang,Gerard J.;Chen,Jer-Jeong;Kuo,David;Liaw,Sheng-Chyang
Contributors:	數學研究所
Keywords:	L(2;1)-LABELING PROBLEM;CHANNEL ASSIGNMENT;GRAPHS;PATH
Date:	2007
Issue Date:	2010-07-07 11:40:10 (UTC+8)
Publisher:	中央大學
Abstract:	For positive integers J >= k, an L (j, k)-labeling of a digraph D is a function f from V (D) into the set of nonnegative integers such that vertical bar f (x) - f (y) vertical bar >= j if x is adjacent to y in D and vertical bar f (x) - f (y)vertical bar
Relation:	DISCRETE APPLIED MATHEMATICS
Appears in Collections:	[Graduate Institute of Mathematics] journal & Dissertation

Files in This Item:

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

社群 sharing