{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T09:15:43Z","timestamp":1790500543562,"version":"4.1.0"},"reference-count":25,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2010,2]]},"abstract":"<jats:p> A recursive circulant graph G(N,d) has N = cd<jats:sup>m<\/jats:sup> vertices labeled from 0 to N - 1, where d \u2a7e 2, m \u2a7e 1, and 1 \u2a7d c &lt; d, and two vertices x,y \u2208 G(N,d) are adjacent if and only if there is an integer k with 0 \u2a7d k \u2a7d \u2308 log <jats:sub>d<\/jats:sub> N\u2309 - 1 such that x \u00b1 d<jats:sup>k<\/jats:sup> \u2261 y ( mod N). With the aid of recursive structure, such class of graphs has many attractive features and was considered as a topology of interconnection networks for computing systems. The design of multiple independent spanning trees (ISTs) has many applications in network communication. For instance, it is useful for fault-tolerant broadcasting and secure message distribution. In the previous work of Yang et al. (2009), we provided a constructing scheme to build k ISTs on G(cd<jats:sup>m<\/jats:sup>,d) with d \u2a7e 3, where k is the connectivity of G(cd<jats:sup>m<\/jats:sup>,d). However, the proposed constructing rules cannot be applied to the case of d = 2. For the integrity of solving the IST problem on recursive circulant graphs, this paper deals with the case of G(2<jats:sup>m<\/jats:sup>,2) using a set of different constructing rules. Especially, we show that the heights of ISTs for G(2<jats:sup>m<\/jats:sup>,2) are lower than the known optimal construction of hypercubes with the same number of vertices. <\/jats:p>","DOI":"10.1142\/s0129054110007143","type":"journal-article","created":{"date-parts":[[2010,2,8]],"date-time":"2010-02-08T01:27:08Z","timestamp":1265592428000},"page":"73-90","source":"Crossref","is-referenced-by-count":21,"title":["CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2<sup>m<\/sup>, 2)"],"prefix":"10.1142","volume":"21","author":[{"given":"JINN-SHYONG","family":"YANG","sequence":"first","affiliation":[{"name":"Institute of Information Science and Management, National Taipei College of Business, Taipei, Taiwan, ROC"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"JOU-MING","family":"CHANG","sequence":"additional","affiliation":[{"name":"Institute of Information Science and Management, National Taipei College of Business, Taipei, Taiwan, ROC"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"SHYUE-MING","family":"TANG","sequence":"additional","affiliation":[{"name":"Department of Psychology, National Defense University, Taipei, Taiwan, ROC"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"YUE-LI","family":"WANG","sequence":"additional","affiliation":[{"name":"Department of Information Management, National Taiwan University of Science and Technology, Taipei, Taiwan, ROC"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(01)00226-5"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2003.09.003"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(97)00100-5"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(99)00199-5"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(88)90015-6"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703436734"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793244198"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00269-9"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(88)90016-8"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00205-1"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00050-7"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(95)00078-6"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(97)00020-3"},{"key":"rf16","first-page":"1894","volume":"79","author":"Obokata K.","journal-title":"IEICE Trans. Fundamentals of Electronics, Communications and Computer Sciences"},{"key":"rf17","first-page":"742","volume":"28","author":"Park J. H.","journal-title":"Journal of Korean Information Science Society"},{"key":"rf19","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00176-6"},{"key":"rf20","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(96)00138-2"},{"key":"rf21","first-page":"143","volume":"20","author":"Tang S. M.","journal-title":"Journal of Information Science and Engineering"},{"key":"rf23","doi-asserted-by":"publisher","DOI":"10.1142\/S0219265902000677"},{"key":"rf24","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.05.013"},{"key":"rf25","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2007.351709"},{"key":"rf26","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.12.042"},{"key":"rf27","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2006.12.001"},{"key":"rf28","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2005.03.004"},{"key":"rf29","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190130205"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054110007143","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:32:32Z","timestamp":1565137952000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054110007143"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2]]},"references-count":25,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2010,2]]}},"alternative-id":["10.1142\/S0129054110007143"],"URL":"https:\/\/doi.org\/10.1142\/s0129054110007143","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2]]}}}