{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T07:40:19Z","timestamp":1735630819171,"version":"3.32.0"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,8,16]],"date-time":"2024-08-16T00:00:00Z","timestamp":1723766400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,8,16]],"date-time":"2024-08-16T00:00:00Z","timestamp":1723766400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11551002"],"award-info":[{"award-number":["11551002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012579","name":"Natural Science Foundation of Qinghai Province","doi-asserted-by":"publisher","award":["2019-ZJ-7093"],"award-info":[{"award-number":["2019-ZJ-7093"]}],"id":[{"id":"10.13039\/501100012579","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,8,16]]},"DOI":"10.1109\/icait62580.2024.10808020","type":"proceedings-article","created":{"date-parts":[[2024,12,30]],"date-time":"2024-12-30T19:19:13Z","timestamp":1735586353000},"page":"6-12","source":"Crossref","is-referenced-by-count":0,"title":["Minimum and Maximum Strong Diameters of the Strong Product of Cycles and Paths"],"prefix":"10.1109","author":[{"given":"Shikun","family":"Zhou","sequence":"first","affiliation":[{"name":"Computer College, Qinghai Normal University,Xi'ning,China"}]},{"given":"Feng","family":"Li","sequence":"additional","affiliation":[{"name":"Computer College, Qinghai Normal University,Xi'ning,China"}]}],"member":"263","reference":[{"key":"ref1","first-page":"33","article-title":"Strong distance in strong digraphs","volume":"31","author":"Chartrand","year":"1999","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"},{"key":"ref2","first-page":"12","article-title":"Strong distance of complete bipartite graphs","volume-title":"The 19th Workshop on Combinatorial Mathematics and Computation Theory","author":"Lai","year":"2002"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.2478\/forma-2023-0010"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1007\/s00454-023-00555-4"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1007\/s40840-023-01504-3"},{"issue":"04","key":"ref6","first-page":"800","article-title":"Fault diameter of strong product graph of an arbitrary connected graph and a complete graph","volume":"32","author":"Yue","year":"2024","journal-title":"Engineering Letters"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1080\/10406638.2020.1852266"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1142\/s1793830922501713"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1080\/10406638.2021.2006725"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.7151\/dmgt.1647"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1216\/rmj.2021.51.315"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.2989\/16073606.2020.1754958"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1142\/S1793830920500433"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.7151\/dmgt.2074"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1016\/j.ipl.2008.01.001"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1080\/09720529.2017.1316988"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1016\/j.dam.2024.03.018"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.12720\/jait.12.4.287-295"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1016\/j.dam.2006.01.010"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1016\/j.ipl.2008.01.001"},{"issue":"01","key":"ref21","first-page":"33","article-title":"Lower and upper orientable strong radius and diameter of cartesian product of paths","volume":"26","author":"Huang","year":"2009","journal-title":"Journal of Xinjiang Univer-sity(Natural Science Edition)"},{"issue":"27","key":"ref22","first-page":"56","article-title":"Minimum strong diameter orientations of 2-vertex multiplications","volume":"45","author":"Zhang","year":"2009","journal-title":"Computer Engineering and Applications"},{"issue":"2","key":"ref23","first-page":"121","article-title":"Strong radius and strong diameter of lexicographic product of complete graphs","volume":"43","author":"Liu","year":"2023","journal-title":"Journal of Hebei University(Natural Sci-ence Edition)"},{"issue":"4","key":"ref24","first-page":"203","article-title":"Strong radius and strong diameter of lexicographic product of complete graphs","volume":"53","author":"Liu","year":"2023","journal-title":"Mathematics in Practice and Theory"}],"event":{"name":"2024 IEEE 16th International Conference on Advanced Infocomm Technology (ICAIT)","start":{"date-parts":[[2024,8,16]]},"location":"Enshi, China","end":{"date-parts":[[2024,8,19]]}},"container-title":["2024 IEEE 16th International Conference on Advanced Infocomm Technology (ICAIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10807850\/10807809\/10808020.pdf?arnumber=10808020","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T06:45:47Z","timestamp":1735627547000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10808020\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,16]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/icait62580.2024.10808020","relation":{},"subject":[],"published":{"date-parts":[[2024,8,16]]}}}