期刊文献+

一类新的魔术染色(英文) 被引量:13

A New Type of Magical Coloring
下载PDF
导出
摘要 借鉴于Kotzig和Rosa在1970年定义的边魔术全标号,我们给具有p个顶点和q条边的图G定义了一个新的染色标号,叫作k-魔术染色f,其中f是一一映射V(G)∪E(G)→{1,2,…,p+q},使得任何边uv∈E(G)满足f(u)+f(v)=k+f(uv),并得到超级k-魔术染色的概念.我们得到了一些具有k-魔术染色或超级k-魔术染色图的性质以及构造这些图的方法.最后,我们猜测所有的树具有一个超级k-魔术染色. Motivated from the edge-magic total labelling defined by Kotzig and Rosa(1970), we define a nearly k-magic coloring f of a graph G with p vertices and q edges that is a bijection from V(G) U E(G) to {1, 2,...,p + q} such that |f(u) + f(v) - f(uv)|≤ k whenever uv E E(G). We have some results on a k-magic coloring f of G which is a nearly k-magic coloring of G and keeps f(u) + f(v) = k + f(uv) for uv ∈ E(G). Furthermore, we study some graphs with a supper k-magic coloring f that is k-magic coloring and f(u) ≤ p for all u ∈ V(G). We find some ways to construct some graphs having k-magic coloring or supper k-magic coloring, and show some properties about such graphs. At the end of this paper, we conjecture that any tree has a supper k-magic coloring.
出处 《数学进展》 CSCD 北大核心 2008年第5期571-583,共13页 Advances in Mathematics(China)
基金 NSFC(No.40301037)
关键词 全标号 魔术染色 对偶标号 total labelling magic coloring complementary labelling
  • 相关文献

参考文献5

  • 1Bondy, J.A. and Murty, U.S.R., Graph Theory With Application, Macmillan, New York, 1976.
  • 2Bela. Bollobas, The Modern Graph Theory, Springer-Verlag, New Tork, Inc., 1998.
  • 3Joseph, A. Gallian, A survey: Recent results, conjectures and open problems on labeling graphs, J. Graph Theory, 1989, 13(4): 491-504.
  • 4i Kathiresan, K.M, Two classes of graceful graphs, Ars Combinatoria, 2000, 55: 129-132.
  • 5Gallian, J.A., A dynamic survey of graph labelling, The Electronic Journal of Combinatorics, 2007, 14: #DS6, 180pages.

同被引文献18

  • 1Joseph A. Gallian. A Dynamic Survey of Graph Labeling[J]. The Electronic Journal of Combinatorics, 2007,14, DS6.
  • 2Alexander Rosa. On Certain Valuations of the Vertices of a Graph[J]. Theory of Graphs(Internat. Symposium, Rome,July 1966) ,Gordon,Breach N Y,Dunod Paris,1967:349-355.
  • 3Bondy J A, Murty U S R. Graph Theory with Application[M]. Macmillan,New York, 1976.
  • 4Kathiresan K M. Two Classes of Graceful Graphs [J]. Ars Combinatoria,2000,55:129-132.
  • 5Llado A. Largest Cliques in Connected Supermaglc Graphs[J]. DMTCS Proc,AE,2005:219-222.
  • 6Kotzig A,Rosa A. Magic Valuations of Finitegraphs[J]. Canadian Mathematical Bulletin,1970,13(4):451-461.
  • 7谢继国,刘永平,苏旺晖.三色Ramsey数R(3,5,6)的下界[J].甘肃科学学报,2007,19(4):8-11. 被引量:1
  • 8吴康,薛展充.关于圈图C_n的连2距k着色计数[J].华南师范大学学报(自然科学版),2007,39(2):7-10. 被引量:5
  • 9刘海涛,谢继国,苏旺辉.反均值问题的一种递归算法[J].甘肃科学学报,2008,20(2):21-23. 被引量:4
  • 10姚明,姚兵,谢建民.关于图k-魔幻标号的若干结果[J].甘肃科学学报,2010,22(1):1-6. 被引量:11

引证文献13

二级引证文献22

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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