Upper Bound of $L(^{0,1,2}_{d,d,1})$-Labeling Number of a Class of Fissile Graphs
Received:September 08, 2003  
Key Words: Frequency assignment   $R$-unit sphere graph   $L(^{0,1,2}_{d,d,1})$-labeling   fissile graph.  
Fund Project:
Author NameAffiliation
GAO Min-gang School of Math. & System Sci.
Shandong University
Ji'nan
China
Institute of Policy and Management
Chinese Academy of Science
Beijing
China 
LIU Jia-zhuang School of Math. & System Sci.
Shandong University
Ji'nan
China 
Hits: 2369
Download times: 3346
Abstract:
      In this paper, we extend the result for the case where every vertex needs one label to the case where every vertex needs more labels, give the definition of the fissile graph and the definition of $L(^{0,1,2}_{d,d,1})$-labeling of the weighted graphs, and obtain an upper bound of the $L(^{0,1,2}_{d,d,1})$-labeling number of the fissile graphs of $R$-unit sphere graphs.
Citation:
DOI:10.3770/j.issn:1000-341X.2006.01.024
View Full Text  View/Add Comment