EDP Sciences logo
Web of Conferences logo
Search
Menu
All issues Volume 139 (2017) MATEC Web Conf., 139 (2017) 00204 References
Open Access
Issue
MATEC Web Conf.
Volume 139, 2017
2017 3rd International Conference on Mechanical, Electronic and Information Technology Engineering (ICMITE 2017)
Article Number 00204
Number of page(s) 7
DOI https://doi.org/10.1051/matecconf/201713900204
Published online 05 December 2017
  1. Xiaoyuan Suo, Ying Zhu, G. Scott. Owen, Graphical Passwords: A Survey. In Annual Computer Security Applications Conference (ACSAC), December 2005: 463–472. DOI: 10. 1109/CSAC. 2005. 27 Source: DBLP [CrossRef] [Google Scholar]
  2. Hongyu Wang, Jin Xu, Bing Yao. The Key-models And Their Lock-models For Designing New Labellings Of Networks. Proceedings of 2016 IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC 2016) pp565–5568. [Google Scholar]
  3. Hongyu Wang, Jin Xu, Bing Yao. Exploring New Cryptographical Construction Of Complex Network Data. IEEE First International Conference on Data Science in Cyberspace. IEEE Computer Society, (2016):155–160. [Google Scholar]
  4. R.N. Shepard, Recognition memory for words, sentences, and pictures, Journal of Verbal Learning and Verbal Behavior, vol. 6, pp. 156–163, 1967. [CrossRef] [Google Scholar]
  5. Joseph A. Gallian. A Dynamic Survey of Graph Labeling. The Electronic Journal Of Combinatorics, 17 (2014), # DS6. (308 pages, 1693 reference papers) [Google Scholar]
  6. Bondy, J.A. and Murty U.S.R. Graph Theory. Springer, ISBN: 978-1-84628-969-9, e-ISBN: 978-1-84628-970-5, DOI: 10. 1007/978-1-84628-970-5, 2008. [CrossRef] [Google Scholar]
  7. Bing Yao, Xia Liu and Ming Yao. Connections between labellings of trees. Bulletin of the Iranian Mathematical Society, ISSN: 1017-060X (Print) ISSN: 1735-8515 (Online), Vol. 43 (2017): 275–283. [Google Scholar]
  8. Xiangqian Zhou, Bing Yao, Xiang-en Chen and Haixia Tao. A proof to the oddgracefulness of all lobsters. Ars Combinatoria 103 (2012), 13–18. [Google Scholar]
  9. S.M. Hegde. On (k; d)-graceful graphs. Journal of Combinatorics, Information and System Sciences, Vol. 25 (1-4) (2000), 255–265. [Google Scholar]
  10. B.D. Acharya and S.M. Hegde. Arithmetic graphs. J. Graph Theory, 14 (1990), 275–299. [CrossRef] [Google Scholar]
  11. Xiangqian Zhou, Bing Yao, Xiang’en Chen. Every Lobster Is Odd-elegant. Information Processing Letters 113 (2013), 30–33. [Google Scholar]
  12. Jinxia Guo, Bing Yao, Jiajuan Zhang. On Generalized Gracefulness Of Edge-Symmetri Trees. Journal Of Southwestern University (in Chinese), 2013, 35 (2): 62–68. [Google Scholar]
  13. Hui Sun, Bing Yao. On Equivalent Definitions Of Cactus Graphs. 2017 submitted. [Google Scholar]
  14. Hui Sun, Bing Yao. Exploring equivalent definitions of Euler graphs. 2017 submitted. [Google Scholar]
  15. Hui Sun, Bing Yao. Exploring the Odd Gracefulness of Cyclic-Dragon Graphs. 2017 submitted. [Google Scholar]
  16. Hui Sun, Bing Yao. On the odd-elegant quality of cyclic-dragon graphs. 2017 submitted. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.