贺丹
作品数: 1被引量:1H指数:1
  • 所属机构:东南大学数学系
  • 所在地区:江苏省 南京市
  • 研究方向:理学
  • 发文基金:国家自然科学基金

相关作者

林文松
作品数:17被引量:6H指数:1
供职机构:东南大学数学系
研究主题:LABELING 英文 J EDGE TREE
L( 1,2)-edge- labeling for necklaces被引量:1
2014年
For a graph G and two positive integers j and k an m-L j k -edge-labeling of G is an assignment from the set 0 1 … m-to the edges such that adjacent edges receive labels that differ by at least j and edges at distance two receive labels that differ by at least k.Theλ′j k-number of G denoted byλ′j k G is the minimum integer m overall m-L j k -edge-labeling of G.The necklace is a specific type of Halin graph.The L 1 2 -edge-labeling of necklaces is studied and the lower and upper bounds on λ′1 2-number for necklaces are given.Also both the lower and upper bounds are attainable.
贺丹林文松
关键词:NECKLACE