期刊文献+

超级太阳图的felicitous性质 被引量:3

Felicitous property of super sun-graphs
原文传递
导出
摘要 许多环行网络可以被转换成图论中的超级太阳图,使得超级太阳图中的环上每一个节点代表一个服务器,与环所连接的节点代表客户.作者对超级太阳图的felicitous性质进行了研究,利用具有集有序felicitous性质的树构造超了级太阳图,并确定了这类图的felicitous标号.此外,对唯一圈图中的特殊图(超级太阳图)的felicitous性质进行了研究,利用具有felicitous性质的树构造超级太阳图,并确定了这类图的felicitous标号. Many ring-like real-networks can be modeled as super sun-graphs of graph theory in which each node o- a ring-Jike real-network represents a server, and every node connected the ring represents a client. In this paper the felicitous property of super sun-graphs is studied, and based on trees having setordered felicitous labellings, super sun-graphs having felicitous labellings is constructed. Then, the felicitous property of so-called super sun-graphs that are uniquely cyclic graphs is studied, and based on trees having set-ordered felicitous labellings, super sun-graphs having felicitous labellings is also constructed.
出处 《四川大学学报(自然科学版)》 CAS CSCD 北大核心 2014年第4期653-658,共6页 Journal of Sichuan University(Natural Science Edition)
基金 国家自然科学基金(61363060 61163054 61163037)
关键词 felicitous标号 集有序felicitous标号 超级太阳图 Felicitous labelling Set-ordered felicitous labelling Super sun-graph
  • 相关文献

参考文献12

  • 1Rosa A. On certain valuations of the vertices of a graph[C]//Theory of Graphs (Int Symp Rome, Ju- ly 1966). New York: Gordon and Breach, 1966.
  • 2Lee S M, Schmeichel E, Shee S C. On felicitous graphs[J]. Discrete Math, 1991, 93 : 201.
  • 3Gallian J A. A dynamic survey of graph labelling [J]. EJ Combin,2012,17,:#DS6.
  • 4Manickam K, Marudai M, Kala R. Some results on felicitous labelling of graphs[J]. J Combin Math Combin Comput, 2012, 81 : 273.
  • 5Yao B, Cheng H, Yao M, etal. A note on strongly graceful trees[J]. Ars Combinatoria, 2009,92 : 155.
  • 6Zhang J J, Yao B, Wang Z Q, et al. Felicitous la- bellings of some network models[J]. J Soft Engin Appl, 2013, 6: 29.
  • 7王鸿,韩培友.两类大龙虾幸福树的构造性证明[J].郑州大学学报(自然科学版),2000,32(2):4-7. 被引量:4
  • 8韩培友,姚慧.两大类树是幸福树的新证法[J].河南师范大学学报(自然科学版),2001,29(1):20-26. 被引量:4
  • 9何建锋.一类幸福树的构造性证明[J].楚雄师范学院学报,2002,17(3):36-37. 被引量:5
  • 10赵素平,朱胜坤.集序约束集值优化问题的最优性条件[J].四川大学学报(自然科学版),2013,50(5):913-916. 被引量:1

二级参考文献36

  • 1Sin Min Lee,Discrete Math,1991年,93卷,201页
  • 2Koh K M,Congressus Numerantium,1980年,29卷,559页
  • 3Rosa A. On certain valuations of the vertices of a graph [C]. See: Theory of Graphs (Int Symp Rome. July 1966).Gordon and Breach, New York, 1967. 349-355.
  • 4Bermond J C. Graceful graphs, radio antennae and French windmills [C]. See: Graph Theory and Combinatories.Pitman London, 1979.13-37.
  • 5Sin-Min Lee, Schmeichel E, Shee S C. On felicitous graphs[J]. Discrete Mathematics, 1991,93:201-209.
  • 6Grace T. On sequential labelling of graph[J]. J Graph Theory 1983,7:195-201.
  • 7Chen G Y, Yang X Q, Yu H. A nonlinear scalarization function and generalized quasi-vector equilibrium problems[J]. J Glob Optimi, 2005, 32: 451.
  • 8Chen G Y. Yang X Q. Charactrizations of variable domination structures via nonlinear scalarization[J]. J Optimi Theory Appl , 2002. 112. 97.
  • 9Kuroiwa D. Existence theorems of set optimization with set-valued maps[J]. J Inf Optimi Sci. 2003. 24. 73.
  • 10Yu G L. Xu W C. Sufficiency and duality of Gateaux differentiable multiobjective optimization in topological vector spaces[J].四川大学学报:自然科学版,2011,48:973.

共引文献5

同被引文献10

引证文献3

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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