华东师范大学学报（自然科学版） >

2018 , Vol. 2018 >Issue 1: 11 - 16,23

DOI: https://doi.org/10.3969/j.issn.1000-5641.2018.01.002

数学

几种可扩散网络模型的边魔幻偶优美性

  • 李艺春 ,
  • 孙慧 ,
  • 姚兵
展开
  • 1. 山东大学 数学学院, 济南 250100;
    2. 西北师范大学 数学与统计学院, 兰州 730070;
    3. 兰州交通大学 电子与信息工程学院, 兰州 730070
李艺春,女,硕士研究生,主要研究方向为复杂网络.E-mail:aspire_lyc@163.com.

收稿日期: 2016-09-14

  网络出版日期: 2018-01-11

基金资助

国家自然科学基金（61163054，61363060，61662066，11461038）

收起

Edge-magic even-gracefulness of several kinds of spread network models

  • LI Yi-chun ,
  • SUN Hui ,
  • YAO Bing
Expand
  • 1. School of Mathematics, Shandong University, Jinan 250100, China;
    2. College of Mathematics and Statistics, Northwest Normal University, Lanzhou 730070, China;
    3. School of Electronics and Information Engineering, Lanzhou Jiaotong University, Lanzhou 730070, China

Received date: 2016-09-14

  Online published: 2018-01-11

Fold

摘要

提出了边魔幻偶优美标号的新标号，给出礼花运算（带标号的加叶子运算）；并扩散了以完全图K3星图等为核心的网络模型，研究了这几类模型的边魔幻偶优美性；把边魔幻奇、偶优美标号进行关联，得到了具有边魔幻优美标号的网络模型.

关键词： 边魔幻偶优美标号; 复杂网络; 无标度图; 礼花运算

本文引用格式

李艺春 , 孙慧 , 姚兵 . 几种可扩散网络模型的边魔幻偶优美性[J]. 华东师范大学学报（自然科学版）, 2018 , 2018(1) : 11 -16,23 . DOI: 10.3969/j.issn.1000-5641.2018.01.002

Abstract

We present a new definition, called edge-magic even-graceful labeling in this paper, and then we discover a new algorithm, called firework operation, which can add leaves with edge-magic graceful labeling and edge-magic even-graceful labeling. We spread several kinds of network models based on the complete graph K3 and star trees and so on, and then investigate their edge-magic even-graceful properties. A connection between the edge-magic odd-graceful labeling and the edge-magic even-graceful labeling is obtained which produces network models with edge-magic graceful labeling.

Key words： edge-magic even-graceful labeling; complex networks; scale-free graph; firework-operation

参考文献

[1] ROSA A. On certain valuations of the vertices of a graph[C]//Theory of Graphs, International Symposium. 1967, 349-355.
[2] MARUMUTHU G. Super edge magic graceful labeling of generalized Petersen graphs[J]. Discrete Mathematics, 2015, 48:235-241.
[3] 王宏宇, 姚兵, 陈祥恩. 探讨几类具有完全图核心的网络模型的优美性[J]. 数学的实践与认识, 2014, 44(2):210-215.
[4] BONDY J A, MURTY U S R. Graph Theory with Applications[M]. London:The Macmillan Press, 1976.
[5] SEDLÁCEK J. Problem 27[M]//Theory of Graphs and its Applications:Proc Symp Smolenice. Praha:Academia, 1963:163-164.
[6] KOH K M, ROGERS D G, TAN T. On graceful trees[J]. Nanta Math, 1977, 10(2):27-31.
[7] ZHOU X Q, YAO B, CHEN X E, et al. A proof to the even-gracefulness of all lobsters[J]. Ars Combinatoria, 2012, 103:13-18.
[8] YAO B, CHENG H, YAO M, et al. A note on strongly graceful trees[J]. Ars Combinatoria, 2009, 92:155-169.
[9] CHENG H, YAO B, CHEN X E, et al. On graceful generalized spiders and caterpillars[J]. Ars Combinatoria, 2008, 87:181-191.
[10] GALLIAN J A. A dynamic survey of graph labelling[J]. The Electronic Journal of Combinatorics, 2011(18), #DS6.
Options
文章导航

/

〈 〉