(2,12,1)-Total number of trees with maximum degree three☆ Export

@article{citeulike:4789506, abstract = {The (2,1) -total labelling number inlMMLBox of a graph 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 2. It is known that every tree T with maximum degree Δ has inlMMLBox . In this paper, we characterize completely the (2,1) -total number of trees with Δ=3 .}, author = {Wang, Weifan and Chen, Dong}, citeulike-article-id = {4789506}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.ipl.2009.03.027}, citeulike-linkout-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0020019009001276}, day = {30}, doi = {10.1016/j.ipl.2009.03.027}, issn = {00200190}, journal = {Information Processing Letters}, keywords = {labeling}, month = {June}, number = {14}, pages = {805--810}, posted-at = {2009-10-06 04:53:59}, priority = {2}, title = {(2,12,1)-Total number of trees with maximum degree three☆}, url = {http://dx.doi.org/10.1016/j.ipl.2009.03.027}, volume = {109}, year = {2009} }

TY - JOUR ID - citeulike:4789506 L3 - citeulike-article-id:4789506 N2 - The (2,1) -total labelling number inlMMLBox of a graph 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 2. It is known that every tree T with maximum degree Δ has inlMMLBox . In this paper, we characterize completely the (2,1) -total number of trees with Δ=3 . IS - 14 JF - Information Processing Letters SN - 00200190 EP - 810 TI - (2,12,1)-Total number of trees with maximum degree three☆ VL - 109 SP - 805 KW - labeling AU - Wang, Weifan AU - Chen, Dong PY - 2009/06/30/ UR - http://dx.doi.org/10.1016/j.ipl.2009.03.027 ER -