Back to Search
Start Over
Image-Type Labellings/Colorings In Graph Homomorphisms And Graphic Lattices
- Source :
- 2020 IEEE 9th Joint International Information Technology and Artificial Intelligence Conference (ITAIC).
- Publication Year :
- 2020
- Publisher :
- IEEE, 2020.
-
Abstract
- In topological authentication for encrypting networks wholly we define matchings of dual-type and image-type labellings/colorings, such as totally-dual $(W_{f},\ W_{g})$-type total-image labellings/colorings, uniformly dual-image $(W_{f},\ W_{g})$-type labellings/colorings; and moreover we define graph edge-homomorphism from a graph to another graph, graph edge-homomorphism, dual-image graph base-homomorphism, matching of $(W_{f},\ W_{g})$-type number strings. The Number String Decomposition Problem is proposed for resisting possibly the attack of supercomputers and quantum computing.
- Subjects :
- Matching (graph theory)
Computer science
String (computer science)
ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION
0102 computer and information sciences
01 natural sciences
Combinatorics
010201 computation theory & mathematics
Graph (abstract data type)
Graph homomorphism
Homomorphism
Decomposition problem
Image type
Quantum computer
Subjects
Details
- Database :
- OpenAIRE
- Journal :
- 2020 IEEE 9th Joint International Information Technology and Artificial Intelligence Conference (ITAIC)
- Accession number :
- edsair.doi...........96f975a35539545bdbe8e2414dbc3d45