EDP Sciences logo
Web of Conferences logo
Search
Menu
All issues Volume 139 (2017) MATEC Web Conf., 139 (2017) 00206 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 00206
Number of page(s) 6
DOI https://doi.org/10.1051/matecconf/201713900206
Published online 05 December 2017
  1. Suo Xiaoyuan, Zhu Ying, Scott G. Owen. Graphical Password: A Survey. In: Proceedings of Annual Computer Security Applications Conference (ACSAC), Tucson, Arizona. IEEE (2005) 463–472. [Google Scholar]
  2. R. Biddle, S. Chiasson, and van Oorschot P.C. Graphical passwords: Learning from the First Twelve Years. ACM Computing Surveys, 44(4), Article 19:1-41. Technical Report TR-09-09, School of Computer Science, Carleton University, Ottawa, Canada. 2009. [Google Scholar]
  3. Gao Haichang, Jia Wei, Ye Fei and Licheng Ma. A Survey on the Use of Graphical Passwords in Security. Journal Of Software, Vol. 8, No. 7, July 2013, 1678–1698. [Google Scholar]
  4. Rosa A. On certain valuations of the vertices of a graph. Theory of Graphs, 1967:349–355. [Google Scholar]
  5. Joseph A. Gallian. A Dynamic Survey of Graph Labeling. The electronic journal of combinatorics, 17 (2014), # DS6. [Google Scholar]
  6. Wang Hongyu, Xu Jin, 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]
  7. Wang Hongyu, Yao Bing, Yang Chao, Yang Sihua, Xiang-en Chen, Yao Ming, Zhenxue Zhao Edge-Magic Total Labellings Of Some Network Models. (Proceeding of ISCCCA13, Published by Atlantis Press, Paris, France, 2013, 0491–0494. ) Applied Mechanics and Materials Vols. 347-350 (2013) pp 2752–2757. [Google Scholar]
  8. Wang Hongyu, YAO Bing, YANG Chao, YANG Sihua, Xiang’en CHEN Labelling Properties Of Models Related with Complex Networks Based On Constructible Structures. Advanced Materials Research Vols. 765-767 (2013) pp 1118–1123. DOI:10. 4028/www.scientific.net/AMR.765-767.1118 [CrossRef] [Google Scholar]
  9. Wang Hongyu, Yao Bing, Ming Yao Generalized Edge-Magic Total Labellings Of Models from researching Networks. Information Sciences 279 (2014) 460–467. DOI:10. 1016/j. ins. 2014. 03. 132 [CrossRef] [Google Scholar]
  10. Yao Bing, Cheng Hui, Yao Ming and Zhao Meimei, A Note on Strongly Graceful Trees. Ars Combinatoria 92 (2009), 155–169. [Google Scholar]
  11. Zhou Xiangqian, Yao Bing, Xiang-en Chen and Haixia Tao A proof to the odd-gracefulness of all lobsters. Ars Combinatoria 103 (2012), 13–18. [Google Scholar]
  12. Zhou Xiangqian, Yao Bing, Xiang’en Chen Every Lobster Is Odd-elegant. nInformation Processing Letters, 113 (2013), 30–33. [CrossRef] [Google Scholar]
  13. B. YAO, X. LIU and M. YAO Connections Between Labellings Of Trees. Bulletin of the Iranian Mathematical Society, Vol. 43, No. 2 (2017): 275–283. [Google Scholar]
  14. Wang Hongyu, Xu Jin, 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): 565–5568. [Google Scholar]
  15. Wang Hongyu, Xu Jin, Bing Yao Exploring New Cryptographical Con-struction Of Complex Network Data. IEEE First International Conference on Data Science in Cyberspace. IEEE Computer Society, (2016):155–160. [Google Scholar]
  16. Suo Xiaoyuan, Zhu Ying, Scott G. 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]
  17. Yao Bing, Cheng Hui, Yao Ming, Zhao Meimei, A note on strongly graceful trees, Ars Combinator. 92 (2009) 155–169. [Google Scholar]
  18. Zhou Xiangqian, Yao Bing, Xiang’en Chen, Haixia Tao, A proof to the oddgracefulness of all lobsters, Ars Combinator. 103 (2012) 13–18. [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.