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

李艺春; 孙慧; 姚兵

doi:10.3969/j.issn.1000-5641.2018.01.002

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

doi: 10.3969/j.issn.1000-5641.2018.01.002

李艺春^1,2,,
孙慧²,
姚兵^2,3, ,

1.
山东大学数学学院, 济南 250100
2.
西北师范大学数学与统计学院, 兰州 730070
3.
兰州交通大学电子与信息工程学院, 兰州 730070

基金项目:

国家自然科学基金 61163054

国家自然科学基金 61363060

国家自然科学基金 61662066

国家自然科学基金 11461038

详细信息

作者简介:
李艺春, 女, 硕士研究生, 主要研究方向为复杂网络.E-mail:aspire_lyc@163.com

通讯作者:
姚兵, 男, 教授, 研究方向为图着色、标号以及复杂网络.E-mail:yybb918@163.com

中图分类号: O157.5
计量
- 文章访问数: 235
- HTML全文浏览量: 93
- PDF下载量: 365
- 被引次数: 0
出版历程
- 收稿日期: 2016-09-14
- 刊出日期: 2018-01-25

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

LI Yi-chun^{1,2
,},
SUN Hui²,
YAO Bing^{2,3
, ,}

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

摘要

摘要: 提出了边魔幻偶优美标号的新标号，给出礼花运算（带标号的加叶子运算）；并扩散了以完全图K₃星图等为核心的网络模型，研究了这几类模型的边魔幻偶优美性；把边魔幻奇、偶优美标号进行关联，得到了具有边魔幻优美标号的网络模型.
- 边魔幻偶优美标号 /
- 复杂网络 /
- 无标度图 /
- 礼花运算
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 K₃ 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.
- edge-magic even-graceful labeling /
- complex networks /
- scale-free graph /
- firework-operation

HTML全文

图 1 左图解释引理2.2, 右图解释引理2.4

Fig. 1 Left is for illustrating Lemma 2.2, Right is for illustrating Lemma 2.4

下载: 全尺寸图片幻灯片

图 2 解释推论2.3 ⅰ)、ⅱ)、ⅲ)的例子

Fig. 2 Examples for illustrating Corollary2.3 ⅰ), ⅱ) and ⅲ

下载: 全尺寸图片幻灯片

图 3 左图解释推论2.3的结论ⅳ), 右图解释引理2.1

Fig. 3 Left is for illustrating the results ⅳ) of Corollary 2.3, Rightis for illustrating Lemma 2.1

下载: 全尺寸图片幻灯片

图 4 左图解释定理2.5, 右图解释定理2.6

Fig. 4 Left is for illustrating Theorem 2.5, Right is for illustrating Theorem 2.6

下载: 全尺寸图片幻灯片

图 5 解释定理2.7的一个例子

Fig. 5 An example for illustrating Theorem2.7

下载: 全尺寸图片幻灯片

图 6 解释本文结论的一个例子

Fig. 6 An example for illustrating the results of the article

下载: 全尺寸图片幻灯片

图 7 解释本文结论的另一个例子

Fig. 7 Another example for illustrating the results of the article

下载: 全尺寸图片幻灯片

参考文献(10)

[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. https://www.sciencedirect.com/science/article/pii/S1571065315000360
[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ÁČEK 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. https://www.researchgate.net/publication/242444232_On_Graceful_Trees
[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. https://www.researchgate.net/publication/265507532_A_Note_on_Strongly_Graceful_Trees
[9]	CHENG H, YAO B, CHEN X E, et al. On graceful generalized spiders and caterpillars[J]. Ars Combinatoria, 2008, 87:181-191. https://www.researchgate.net/publication/220620157_On_Graceful_Generalized_Spiders_and_Caterpillars
[10]	GALLIAN J A. A dynamic survey of graph labelling[J]. The Electronic Journal of Combinatorics, 2011(18), #DS6. https://www.researchgate.net/publication/2827653_A_Dynamic_Survey_of_Graph_Labeling