Title :
(d,1)-total Labeling Number of the Product of Path and Fan
Author :
Xue, Han ; Sumei, Zhang
Author_Institution :
Sch. of Math. Sci., Univ. of Jinan, Jinan, China
Abstract :
The (d, 1)-total labeling number of a graph delta ddT (G) is the width of the smallest range of integers that suffices to label the vertices and the edges of G such that no two adjacent vertices have the same label, no two adjacent edges have the same label and the difference between the labels of a vertex and its incident edges is at least d. In this paper, we studied the upper bound of delta ddT (G) of the product of path and fan.
Keywords :
graph theory; adjacent vertices; graph; product of path and fan; total labeling number; Educational institutions; Labeling; Radio spectrum management; Radio transmitters; Radiofrequency interference; Resource management; Upper bound; (d; 1)-labeling number; path and fan; upper bound;
Conference_Titel :
Business Computing and Global Informatization (BCGIN), 2012 Second International Conference on
Conference_Location :
Shanghai
Print_ISBN :
978-1-4673-4469-2
DOI :
10.1109/BCGIN.2012.212
