{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,3]],"date-time":"2024-08-03T05:52:07Z","timestamp":1722664327616},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2009,9]]},"abstract":"<jats:p> Because of its applications in network theory, the wide diameter of graphs has been studied extensively in recent years. It is still an open problem to compute the wide diameter of Cayley graphs. This paper investigates the wide diameter of Cayley graphs of \u2124<jats:sub>m<\/jats:sub>, the cyclic group of residue classes modulo m. It is proved that the k-wide diameter of the Cayley graph Cay (Z<jats:sub>m<\/jats:sub>, A) generated by a k-element set A is d + 1 for k = 2 and \u2264 d + 1 for k = 3, where d is the diameter of Cay (\u2124<jats:sub>m<\/jats:sub>, A). <\/jats:p>","DOI":"10.1142\/s0219265909002534","type":"journal-article","created":{"date-parts":[[2009,9,23]],"date-time":"2009-09-23T15:33:52Z","timestamp":1253720032000},"page":"219-231","source":"Crossref","is-referenced-by-count":5,"title":["ON WIDE DIAMETER OF CAYLEY GRAPHS"],"prefix":"10.1142","volume":"10","author":[{"given":"KEVIN E.","family":"JIA","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of Texas at Austin, Austin, Texas 78712, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ALICIA Q.","family":"ZHANG","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, New Jersey 08544, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,4,30]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1995.1002"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2491-2"},{"key":"rf3","first-page":"668","volume":"77","author":"Hsu D. F.","journal-title":"IEICE Trans. Fundamentals E"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480190184811"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1002\/scj.4690170803"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199607)27:4<257::AID-NET1>3.0.CO;2-F"},{"key":"rf8","doi-asserted-by":"crossref","first-page":"83","DOI":"10.11650\/twjm\/1500407056","volume":"3","author":"Liaw S. C.","journal-title":"Taiwanese J. Math."},{"key":"rf9","doi-asserted-by":"crossref","first-page":"75","DOI":"10.11650\/twjm\/1500407401","volume":"6","author":"Lu C.","journal-title":"Taiwanese J. Math."},{"key":"rf10","first-page":"863","volume":"31","author":"Pradhan D. K.","journal-title":"IEEE Trans. Comput. C"},{"key":"rf11","volume-title":"Discrete Mathematics and Its Applications","author":"Rosen K. H.","year":"2007"},{"key":"rf12","volume-title":"Introduction to Graph Theory","author":"West D.","year":"2001"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1145\/321832.321838"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265909002534","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T17:57:39Z","timestamp":1565114259000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219265909002534"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9]]},"references-count":12,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2012,4,30]]},"published-print":{"date-parts":[[2009,9]]}},"alternative-id":["10.1142\/S0219265909002534"],"URL":"https:\/\/doi.org\/10.1142\/s0219265909002534","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"value":"0219-2659","type":"print"},{"value":"1793-6713","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,9]]}}}