Topological graph passwords based on the gracefulness of disconnected graphs with circles

MU Yarong; LIU Xinsheng; YAO Bing

doi:10.3969/j.issn.1000-5641.201811045

Issue 1

Jan. 2020

Turn off MathJax

Article Contents

Article Navigation > Journal of East China Normal University (Natural Sciences) > 2020 > (1): 51-57

MU Yarong, LIU Xinsheng, YAO Bing. Topological graph passwords based on the gracefulness of disconnected graphs with circles[J]. Journal of East China Normal University (Natural Sciences), 2020, (1): 51-57. doi: 10.3969/j.issn.1000-5641.201811045

Citation:

MU Yarong, LIU Xinsheng, YAO Bing. Topological graph passwords based on the gracefulness of disconnected graphs with circles[J]. Journal of East China Normal University (Natural Sciences), 2020, (1): 51-57. doi: 10.3969/j.issn.1000-5641.201811045

Citation:

PDF( 960 KB)

Topological graph passwords based on the gracefulness of disconnected graphs with circles

doi: 10.3969/j.issn.1000-5641.201811045

College of Mathematics and Statistics, Northwest Normal University, Lanzhou　730070, China

Received Date: 2018-11-21
Available Online: 2019-12-03
Publish Date: 2020-01-01

Abstract

Abstract

Graph labeling is an important branch of graph theory. We use disconnected graphs to start our study, and show that disconnected graphs $G= (C_{4},\overline{K}_{r})\cup$$ \bigcup _{t=1}^k K^{t}_{m, n}$ and $G= (C_{4},\overline{K}_{r})\cup$$ K_{1, n}\cup \bigcup_{t=1}^k T^t$ allow graceful labelings. Algorithms can be used to provide a theoretical basis for proving the application of disconnected graphs to networks.
- disconnected graphs,
- complete bipartite graphs,
- graceful labeling

FullText(HTML)

References(16)

References

[1]	WANG H Y, XU J, YAO B. Exploring new cryptographical construction of complex network data [C]// IEEE First International Conference on Data Science in Cyberspace. IEEE Computer Society, 2016: 155-160.
[2]	WANG H Y, XU J, YAO B. The key-models and their lock-models for designing new labellings of networks [C]// Proceedings of 2016 IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC 2016). 2016: 565-568.
[3]	WANG H Y, XU J, YAO B. Twin odd-graceful trees towards information security [J]. Procedia Computer Science, 2017, 107: 15-20. DOI: 10.1016/j.procs.2017.03.050.
[4]	ROSA A. On certain valuations of the vertices of a graph [C]// Theory of Graph, International Symposium. New York: Gordon and Breach, 1967: 349-355.
[5]	王涛, 王清, 李德明. 几类与圈有关图的优美性 [J]. 西南大学学报(自然科学版), 2013, 35(8): 83-87.
[6]	王涛, 王清, 李德明. 非连通图 $\scriptstyle (P_{3}\vee\overline{K}_{r})\cup G$ 及 $\scriptstyle (C_{3}\vee\overline{K}_{r})\cup S(l)$ 的优美性 [J]. 中山大学学报(自然科学版), 2012, 51(5): 54-62.
[7]	MARUMUTHU G. Super edge magic graceful labeling of generalized Petersen graphs [J]. Discrete Mathematics, 2015: 235-241.
[8]	潘伟, 路线. 两类非连通图 $\scriptstyle (P_{3}\vee\overline{K}_{r})\cup S(l)$ 及 $\scriptstyle (P_{3}\vee\overline{K}_{r})\cup T_{n}$ 的优美性 [J]. 吉林大学学报(理学版), 2003, 41(2): 152-154. DOI: 10.3321/j.issn:1671-5489.2003.02.006.
[9]	吴跃生, 王广富, 徐保根. 非连通图 $\scriptstyle C_{4k+2}^{(2)}\cup G_{m}$ 的优美性 [J]. 西南师范大学学报(自然科学版), 2013, 38(12): 19-23.
[10]	刘家保, 潘向峰. 轮形图和扇型图的优美性 [J]. 安徽大学学报(自然科学版), 2009, 33(4): 11-13. DOI: 10.3969/j.issn.1000-2162.2009.04.004.
[11]	魏丽侠, 贾治中. 非连通图 $\scriptstyle G_{1}\cup G_{2}$ 及 $\scriptstyle G_{1}\cup G_{2}\cup K_{2}$ 的优美性 [J]. 应用数学学报, 2005, 28(4): 689-694. DOI: 10.3321/j.issn:0254-3079.2005.04.012.
[12]	刘瑞芹, 张昆龙. 非连通并图的优美标号研究 [J]. 合肥工业大学学报(自然科学版), 2009, 32(6): 940-944. DOI: 10.3969/j.issn.1003-5060.2009.06.040.
[13]	蔡华. 几类非连通图的优美性 [D]. 长春: 吉林大学, 2007.
[14]	MU Y R, YAO B. On disconnected topological graph passwords for information security [C]// 2018 IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC 2018). 2018: 2109-2113.
[15]	孙慧, 姚兵. 关于圈龙图的奇优雅性 [J]. 大连理工大学学报(自然科学版), 2017, 57(5): 531-536.
[16]	BONDY A, MURTY U S R. Graph Theory with Applications [M]. Amsterdam: NortT-Tolland, 1976.