Abstract
With the fast development of networks, one has to focus on the security of information running in real networks. A technology that might be able to resist attacks equipped with AI techniques and quantum computers is the so-called topological graphic password of topological coding. In order to further study topological coding, we use the multiple constraints of graph colorings and labelings to propose 6C-labeling, 6C-complementary labeling, and its reciprocal-inverse labeling, since they can be applied to build up topological coding. We show some connections between 6C-labeling and other graph labelings/colorings and show graphs admitting twin-type 6C-labelings, as well as the construction of graphs admitting twin-type 6C-labelings.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
