期刊文献+

立方路的多级距离数

The multi-level distance number for cubic paths
下载PDF
导出
摘要 连通图G的多级距离标号(电台标号)是顶点集V(G)到非负整数集{0,1,2,…}的一个映射f,使得对于任意的u,v∈V(G)满足:f(u)-f(v)≥diam(G)+1-d(u,v),其中diam(G)是图G的直径,d(u,v)表示两点u,v之间的距离.映射f的跨度是指max u,v∈V(G){f(u)-f(v)}.图G的多级距离数是指图G的所有多级距离标号的最小跨度.图G的立方是由图G通过在距离不超过3的任两点间添加一条连边构成.本文给出了立方路的多级距离数. The multi-level distance labeling for a connected graph G,also called the radio labeling,is a mapping f:V(G)→ {0,1,2,…}such that for any u,v∈V(G),f(u)-f(v) ≥diam(G)+1-d(u,v),where diam(G)is the diameter of G,and d(u,v)denote the distance between uand vin G.The span of f is defined as max u,v∈V(G){f(u)-f(v)}.The multi-level distance number of a graph Gis the minimum span of all multi-level distance labeling for G.The cubic of Gis a graph constructed from G by adding edges between vertices of distance at most three parts in G.In this paper,the multi-level distance number for the cubic path is obtained.
出处 《西北师范大学学报(自然科学版)》 CAS 北大核心 2015年第2期12-18,共7页 Journal of Northwest Normal University(Natural Science)
基金 国家自然科学青年基金资助项目(61103073)
关键词 多级距离数 多级距离标号 有效频道分配 最小跨度 立方路 multi-level distance number multi-level distance labeling valid radio channel assignment minimum span cubic path
  • 相关文献

参考文献17

  • 1CHANG G,KE C,KUO D,et al.A generalized distance two labeling of graphs[J].Disc Math,2000,220:57-66.
  • 2CHANG G,KUO D.The L(2,1)-labeling problem on graphs[J].SIAM J Disc Math,1996,9:309-316.
  • 3CHARTRAND G,ERWIN D,HARARY F,et al.Radio labelings of graphs[J].Bull Inst Combin AppL,2001,33:77-85.
  • 4CHARTRAND G,ERWIN D,ZHANG P.A graph labeling problem suggested by FM channel restHctions[J].Bull Inst Combin Appl-,2005,43:43-57.
  • 5GEORGES J,MAURO D.Generalized vertex labelings with a condition at distance two[J].Congr Numer,1995,109;141-159.
  • 6GEORGES J,MAURO D,STEIN M.Labeling products of complete graphs with a condition at distance two[J].SIAM J Discrete Math,2001,14:28-35.
  • 7GEORGES J,MAURO D,WHITTLESEY M.On the size of graphs labeled with a condition at distance two[J].J Graph Theory,1996,22:47-57.
  • 8GEORGES J,MAUROD,WHITTLESEY M.Relating path covering tovertex labelings with a condition at distance two[J].Disc Math,1994,135:103-111.
  • 9GRIGGS J R,YEH R K.Labeling graphs with a condition at distance 2[J].SIAM J Di.sc Math,1992,5:586-595.
  • 10CHARTRAND G,ERWIN D,ZHANG P.Radio antipodal colorings of cycles [J].Congr Numer,2000,144:129-141.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部