期刊文献+

关于奇强协调图的一些结果 被引量:2

Some Results of Odd Strong Harmonious Graph
原文传递
导出
摘要 对于一个(p,q)-图G,如果存在一个单射f:V(G)→{0,1,…,2q-1},使得边标号集合{f(uv)|uv∈E(G)}={1,3,5,…,2q-1},其中边标号为f(uv)=f(u)+f(v),那么称G是奇强协调图,并称f是G的一个奇强协调标号.通过研究若干奇强协调图,得出一些奇强协调图的性质. For a (p, q)-graph G, if it there is an injection from V(G) to {0, 1,..., 2q - 1} such that the set of all edge labels is equal to (1, 3,..., 2q - 1}, where the label of an edge uv of G is f(uv) -= f(u) + f(v), then G is called an odd strong harmonious graph, and f is an odd strong harmonious labelling of G. In this paper, though research server graph get some odd strong harmonious graph's results.
作者 刘广军
出处 《数学的实践与认识》 CSCD 北大核心 2013年第11期271-275,共5页 Mathematics in Practice and Theory
基金 2013年度河南省科技计划项目(132400410582)
关键词 二部图 集合有序奇优美标号 奇强协调图 bipartite graph set-ordered odd-graceful labelling odd strong harmonious graph
  • 相关文献

参考文献9

  • 1Gallian J A. A Dynamic Survey of Graph Labeling[J]. The Electronic Journal of Combinatiorics, 2011, 18: 20-43.
  • 2Bloom G S, Golomb S W. Applications of numbered graphs[J]. Proc Ieee, 1977, 65: 562-570.
  • 3Graham R L and Sloane N J A. On additive bases and harmonious graphs[J]. Discrete Mathematics 1980, 1: 382-404.
  • 4Frank Hsu D. Harmonious labellings of windmill graphs and related graphs[J]. Journal of Graph Theory, 1982, 611): 85-87.
  • 5冉红,李武装.直径为4的树的奇强协调性[J].数学的实践与认识,2007,37(12):133-136. 被引量:5
  • 6Bondy J A, Murty U S R. Graph Theory with Applications[M]. The MaCmillan Press ltd, New York. 1976.
  • 7Gnanajothi R B. Topics in Graph Theory, Ph.D. Thesis[D]. Mad/lrai Kamaraj University, 1991.
  • 8Yao Bing, Cheng Hui, Yao Ming, Zhao Meimei. A note on Strongly Graceful Trees[J]. Ars Combi- natoria, 2009, 92: 155-169.
  • 9Zhou Xiangqian, Yao Bing, Chen Xiang'en, Tao Haixia. A proof to the odd-gracefulness of all lobsters[J]. Ars Combinatoria, 2012, 103: 13-18.

二级参考文献4

  • 1GALLIAN A. A guide to the graph labeling z00[J]. Discrete Applied Mathematics, 1994,49 : 213--229.
  • 2GALLIAN A. A Survey.. Recent Results. Conjectures and open problems in labeling graph[J]. Journal of Graph Theory, 1989.13 (4): 491--504.
  • 3FRANK HSU D. Harmonious labelings of windmill graphs and related graphs[J]. Journal of Graphs Theory, 1982, 6 (1) : 85--87.
  • 4BERMOND JC. Graceful Graphs, Radio Antennal and French Windmills[M]. Graph Thery and Combinatorics (Milton Keynes), 1987. 18--37.

共引文献4

同被引文献20

  • 1冉红,李武装.直径为4的树的奇强协调性[J].数学的实践与认识,2007,37(12):133-136. 被引量:5
  • 2Ringel G.Problem 25 in theory of graphs and its apphcation[J].Proc Symposium Smolenice,1963:162.
  • 3Rosa A.On certain valuations of the vertices of a graph[J].Theory of Graphs Proc Internat Sympos Rome,1967:349-355.
  • 4Golomh S W.How to number a graph[J].Graph Theory and Computing,1972:23-37.
  • 5Grad T.On sequential labelings of graphs[J].Journal of Graph Theory,1983,7:195-210.
  • 6Gnanajothi R B.(1991),Topics is Graph Theory,Ph.D.Tesis,Madurai Kamaraj University India.
  • 7Gallian A.A dynamic survey of graph labeling[J].The Electronic Journal of Combinatorics,2000,12:1-95.
  • 8Frank Hsu D.Harmonious labelings of windmill graphs and related graphs[J].Journal of Graph Theory,1982,6(1):85-87.
  • 9林育青.C_n与1C_n的优美标号[J].Vol.32,No.2 March 2007:13-16.
  • 10Alice Neels and Stephen Privitera,Braid Groups of Sun Graph,ArXiv preprint math.GT/0508380v1,2005.

引证文献2

二级引证文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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