Abstract
We introduce graph operations: adding-removing edge or vertex operations, vertex-splitting and vertex-coinciding operations, edge-splitting and edge-coinciding operations, cycle-coinciding and cycle-splitting operations, H-coinciding and H-splitting operations, and so on. Next we build up graph operation lattices, self-isomorphic graph (anti-)homomorphisms, stochastic-graphic lattices and operation scale-free network lattices in topological coding. We show that our lattices introduced here possess the property like that of collision resistant hash functions.
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.
