J4 ›› 2011, Vol. 24 ›› Issue (5): 46-48.

• Content • Previous Articles     Next Articles

he L(p,1T)-vertex labeling of graphs

 WANG Yan, SUN Lei   

  1. School of Mathematics,Shandong Normal University, Jinan 250014, China
  • Received:2011-05-08 Published:2011-10-20 Online:2011-10-20

Abstract:

       This paper relaxes the restriction conditions of a vertex of distance 2 and puts them on its spanning trees. We therefore presents a new labeling issue, and its general upper bound.

Key words: L(p,1)-vertex labeling, L(p,1T)-vertex labeling, spanning tree, maximum degree

CLC Number: 

  • O157.5

Open Access This article is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0), which permits third parties to freely share (i.e., copy and redistribute the material in any medium or format) and adapt (i.e., remix, transform, or build upon the material) the articles published in this journal, provided that appropriate credit is given, a link to the license is provided, and any changes made are indicated. The material may not be used for commercial purposes. For details of the CC BY-NC 4.0 license, please visit: https://creativecommons.org/licenses/by-nc/4.0