期刊文献+

Sierpiński Gasket图的2-距离着色 被引量:1

2-Distance Coloring of Sierpiński Gasket Graphs
下载PDF
导出
摘要 运用群论中置换的思想,通过置换顶点的着色法,研究Sierpiński gasket图Sn的2-距离着色,且给出了Sierpiński gasket图Sn的2-距离色数的精确值为χ(Sn)=6,其中n≥2. In this paper, the authors study 2 -distance colorin'g of Sierpiflski gasket Graphs Sn by applying vertex color permutation based on the idea of permutation in group theory. Meanwhile, the authors give the exact 2- distance chromatic number of Sierpinski gasket graphs Sn, x2d (Sn)= 6, where n≥2.
出处 《西南师范大学学报(自然科学版)》 CAS CSCD 北大核心 2012年第2期22-25,共4页 Journal of Southwest China Normal University(Natural Science Edition)
基金 中央高校基本科研业务费资助项目(CDJZR10170010) 广西教育厅面上资助项目(200807MS098)
关键词 Sierpiński gasket图 2-距离着色 2-距离色数 Sierpinski gasket graph 2 -distance coloring 2 -distance chromatic number
  • 相关文献

参考文献12

  • 1TEGUIA A M.Sierpiński Gasket Graphs and Some of Their Properties[J].Australas J Combin,2006,35:181-192.
  • 2JAKOVAC M,KLAVZAR S.Vertex-,Edge-,and Total-Colorings of Sierpiński-Like Graphs[J].Discrete Math,2009,309:1548-1556.
  • 3KLIX F,RAUTENSTRAUCH-GOEDE K.Struktur and Komponenten Analyse von Problem Lōsungsprozessen[J].Z Psychol,1967,174:167-193.
  • 4KLAVZAR S.Coloring Sierpiński Graphs and Sierpiński Gasket Graphs[J].Taiwan J Math,2008,12:513-522.
  • 5KLAVZAR S,MOHAR B.Crossing Numbers of Sierpiński-Like Graphs[J].J Graph Theory,2005,50:186-198.
  • 6潘玉美,莫明忠.Sierpiński Gasket图的星着色[J].西南师范大学学报(自然科学版),2011,36(3):17-20. 被引量:1
  • 7FERTIN G,RASPAUD A,REED B.Star Coloring of Graphs[J].Journal of Graph Theory,2004,47(3):163-182.
  • 8张忠辅,刘林忠,王建方,袁晋江.图的强染色[J].西北师范大学学报(自然科学版),2002,38(1):28-29. 被引量:14
  • 9ALON N,MOHAR B.The Chromatic Number of Graph Powers[J].Combinatorics Probability and Computing,2002,11:1-10.
  • 10马宝林,陈祥恩,刘娟.图的强直积的2-距离染色(英文)[J].山东大学学报(理学版),2010,45(3):66-70. 被引量:4

二级参考文献32

  • 1谢德政.关于几乎正则2-连通图的Hamilton性的注记[J].西南师范大学学报(自然科学版),2004,29(4):570-572. 被引量:4
  • 2Fertin G, Raspaud A, Reed B. Star Coloring of Graphs [J]. Journal of Graph Theory , 2004, 47(3) : 163 -- 182.
  • 3Alon N, Mohar B. The Chromatic Number of Graph Powers [J]. Combinatorics, Probability and Computing, 2002, (11) : 1--10.
  • 4Bondy J A, Murty U S R. Graph Theory [M]. Berlin:Springer, 2008.
  • 5Daniel W C. Strong Edge-Coloring of Graphs With Maximum Degree 4 Using 22 Colors [J ]. Discrete Math, 2006, 306: 2772 -- 2778.
  • 6BONDY J A, MURTY U S R. Graph theory[M]. London: Springer, 2008.
  • 7JENSEN T R, TOFT B. Graph coloring problems[M]. New York: Wiley, 1995.
  • 8ALON N, MOHAR B. The chromatic number of graph powers [J]. Combinatorics, Probability and Computing, 2002, 11 : 1-10.
  • 9AGNARSSON G, HALLDORSSON M M. Coloring powers of planar graphs [J]. SIAM J Discrete Mathmatics, 2003, 16 (4) :651-662.
  • 10BORODIN O V, BROERSMA H J, GLEBOV A, et al. Stars and bunches in planar graphs : Part Ⅰ. triangulations CDAM research report series [J].Original Russian Version. Diskretn Anal Lssled Oper Ser, 2001, 18 (2) :15-39.

共引文献19

同被引文献5

引证文献1

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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