摘要
<span style="font-family:Verdana;">This note is considered as a sequel of Yeh [<a href="#ref1">1</a>]. Here, we present a generalized (vertex) distance labeling (labeling vertices under constraints depending the on distance between vertices) of a graph. Instead of assigning a number (label) to each vertex, we assign a set of numbers to each vertex under given conditions. Some basic results are given in the first part of the note. Then we study a particular class of this type of labelings on several classes of graphs.</span>
<span style="font-family:Verdana;">This note is considered as a sequel of Yeh [<a href="#ref1">1</a>]. Here, we present a generalized (vertex) distance labeling (labeling vertices under constraints depending the on distance between vertices) of a graph. Instead of assigning a number (label) to each vertex, we assign a set of numbers to each vertex under given conditions. Some basic results are given in the first part of the note. Then we study a particular class of this type of labelings on several classes of graphs.</span>
作者
Roger K. Yeh
Roger K. Yeh(Department of Applied Mathematics, Feng Chia University, Taiwan)
