{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T09:22:33Z","timestamp":1778059353674,"version":"3.51.4"},"reference-count":23,"publisher":"World Scientific Pub Co Pte Ltd","issue":"04","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61363060"],"award-info":[{"award-number":["61363060"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61662066"],"award-info":[{"award-number":["61662066"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Science Found of Qinghai","award":["2021-ZJ-703"],"award-info":[{"award-number":["2021-ZJ-703"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2026,5]]},"abstract":"<jats:p>The graph lattice in topological coding is a new encryption technology, like lattice base encryption. The graphs in a graph lattice are stored by matrices and run in a computer. The main theoretical techniques for topological coding come from mathematical disciplines such as discrete mathematics, number theory, and algebra. Because topological coding involves a large number of mathematical conjectures and NP problems, the numeric based strings generated by topological coding have irreversibility and computational security. In this paper, we have show some new labels and coloring, which are defined as follows: [Formula: see text]-module edge-difference total coloring, super [Formula: see text]-module edge-difference total coloring, set-ordered [Formula: see text]-module edge-difference total colorings and edge-difference [Formula: see text] total colorings. We have proven the graph obtained by three kinds of graph operations has the edge-difference type colorings and show the leaf adding algorithm. Our results can proved by algorithmic proofs.<\/jats:p>","DOI":"10.1142\/s1793830925500697","type":"journal-article","created":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T23:21:58Z","timestamp":1743808918000},"source":"Crossref","is-referenced-by-count":0,"title":["Edge\u2013difference total labeling and coloring of some bipartite graphs"],"prefix":"10.1142","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-0052-0276","authenticated-orcid":false,"given":"Xiaohui","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Computer and Communication, Lanzhou University of Technology, Lanzhou 730050, P. R. China"},{"name":"College of Electrical and Information Engineering, Lanzhou University of Technology, Lanzhou 730050, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1611-9017","authenticated-orcid":false,"given":"Tao","family":"Feng","sequence":"additional","affiliation":[{"name":"School of Computer and Communication, Lanzhou University of Technology, Lanzhou 730050, P. R. China"},{"name":"College of Electrical and Information Engineering, Lanzhou University of Technology, Lanzhou 730050, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5416-5180","authenticated-orcid":false,"given":"Bing","family":"Yao","sequence":"additional","affiliation":[{"name":"College of Mathematics and Statistics, Northwest Normal University, Lanzhou 730070, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2025,6,20]]},"reference":[{"key":"S1793830925500697BIB001","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-019-1666-5"},{"key":"S1793830925500697BIB002","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190140302"},{"key":"S1793830925500697BIB003","doi-asserted-by":"publisher","DOI":"10.1111\/j.1749-6632.1979.tb32778.x"},{"key":"S1793830925500697BIB004","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5"},{"key":"S1793830925500697BIB005","first-page":"1","volume":"17","author":"Gallian J. A.","year":"2020","journal-title":"Electron. J. Combin."},{"key":"S1793830925500697BIB006","first-page":"41","volume":"7","author":"Gervacio S. V.","year":"1983","journal-title":"Sea Bull. Math."},{"key":"S1793830925500697BIB007","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-018-9872-3"},{"key":"S1793830925500697BIB008","first-page":"101","volume":"72","author":"Harary F.","year":"1990","journal-title":"Congr. Numer."},{"key":"S1793830925500697BIB009","first-page":"79","volume":"6","author":"Hegde S. M.","year":"2009","journal-title":"AKCE J. Graphs Combin."},{"key":"S1793830925500697BIB010","doi-asserted-by":"crossref","unstructured":"S. Katsumata, T. Matsuda and A. Takayasu, Lattice-based revocable(hierarchical) IBE with decryption key exposure resistance, https:\/\/www.sciencedirect.com\/sci- ence\/article\/abs\/pii\/S0304397519307650 (2020).","DOI":"10.1016\/j.tcs.2019.12.003"},{"key":"S1793830925500697BIB011","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88702-7_5"},{"issue":"2","key":"S1793830925500697BIB012","first-page":"159","volume":"15","author":"Niederreiterh H.","year":"1986","journal-title":"Probl. Control Inf. Theory"},{"key":"S1793830925500697BIB013","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144598347011"},{"key":"S1793830925500697BIB014","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1185"},{"key":"S1793830925500697BIB015","doi-asserted-by":"publisher","DOI":"10.3390\/math10010109"},{"key":"S1793830925500697BIB016","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2021.102212"},{"issue":"1","key":"S1793830925500697BIB017","first-page":"13","volume":"1","author":"Wang X. -Y.","year":"2014","journal-title":"J. Crypt. Res."},{"key":"S1793830925500697BIB018","doi-asserted-by":"publisher","DOI":"10.1109\/DSC.2016.76"},{"key":"S1793830925500697BIB019","first-page":"9482345","volume":"2018","author":"Wang H. Y.","year":"2018","journal-title":"Secur. Commun. Netw."},{"key":"S1793830925500697BIB020","unstructured":"B. Yao\n                      et al.\n                      , Topological coding and topological matrices toward network overall security, preprint (2019), arXiv:190901587."},{"issue":"4","key":"S1793830925500697BIB021","first-page":"53","volume":"17","author":"You W.","year":"2017","journal-title":"Netinfo Security"},{"key":"S1793830925500697BIB022","unstructured":"B. Yao, Graphic lattices and matrix lattices of topological coding, preprint (2020), arXiv:2005.03937v1."},{"key":"S1793830925500697BIB023","doi-asserted-by":"publisher","DOI":"10.1109\/ITAIC49862.2020.9339093"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830925500697","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T09:06:49Z","timestamp":1778058409000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830925500697"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,20]]},"references-count":23,"journal-issue":{"issue":"04","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["10.1142\/S1793830925500697"],"URL":"https:\/\/doi.org\/10.1142\/s1793830925500697","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,20]]},"article-number":"2550069"}}