Graph Theory Towards Module-K Odd-Elegant Labelling Of Graphical Passwords
Zhang Xiaohui, Sun Hui, Yao Bing
MATEC Web of Conferences · 2017
doi:10.1051/matecconf/201713900206 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
Graph labellings have been applied in many areas of science and engineering, such as in the development of redundant arrays of independent disks which incorporate redundancy utilizing erasure codes, algorithms, design of highly accurate optical gauging systems for use on automatic drilling machines, design of angular synchronization codes, design of optimal component layouts for certain circuit-board geometries, and determining configurations of simple resistor networks which can be used to supply any of a specified set of resistance values. Based on the idea of of “topological structure plus number theory” and magic type of various labellings for solving network transfer delay by using other type of graphical passwords. We define a new graph labelling, called Module-K odd-elegant labelling, and find some network models that admit our new labelling, and furthermore our methods can be transformed into effective algorithms.
Abstract licence: CC BY
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.