{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T10:51:19Z","timestamp":1769770279219,"version":"3.49.0"},"reference-count":28,"publisher":"SAGE Publications","issue":"1-4","license":[{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2023,2]]},"abstract":"<jats:p>\n                    A network can contain numerous spanning trees. If two spanning trees\n                    <jats:italic>\n                      T\n                      <jats:sub>i<\/jats:sub>\n                    <\/jats:italic>\n                    ,\n                    <jats:italic>\n                      T\n                      <jats:sub>j<\/jats:sub>\n                    <\/jats:italic>\n                    do not share any common edges,\n                    <jats:italic>\n                      T\n                      <jats:sub>i<\/jats:sub>\n                    <\/jats:italic>\n                    and\n                    <jats:italic>\n                      T\n                      <jats:sub>j<\/jats:sub>\n                    <\/jats:italic>\n                    are said to be\n                    <jats:italic>pairwisely edge-disjoint.<\/jats:italic>\n                    For spanning trees\n                    <jats:italic>T<\/jats:italic>\n                    <jats:sub>1<\/jats:sub>\n                    ,\n                    <jats:italic>T<\/jats:italic>\n                    <jats:sub>2<\/jats:sub>\n                    ,\u2026,\n                    <jats:italic>\n                      T\n                      <jats:sub>m<\/jats:sub>\n                    <\/jats:italic>\n                    , if every two of them are pairwisely edge-disjoint, they are called\n                    <jats:italic>completely edge-independent spanning trees<\/jats:italic>\n                    (CEISTs for short). CEISTs can facilitate many network functionalities, and constructing CEISTs as maximally allowed as possible in a given network is a worthy undertaking. In this paper, we establish the maximal number of CEISTs in the\n                    <jats:italic>locally twisted cube<\/jats:italic>\n                    network, and propose an algorithm to construct\n                    <jats:inline-formula>\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\" overflow=\"scroll\">\n                        <mml:mrow>\n                          <mml:mo>\u230a<\/mml:mo>\n                          <mml:mrow>\n                            <mml:mrow>\n                              <mml:mfrac>\n                                <mml:mi>n<\/mml:mi>\n                                <mml:mn>2<\/mml:mn>\n                              <\/mml:mfrac>\n                            <\/mml:mrow>\n                          <\/mml:mrow>\n                          <mml:mo>\u230b<\/mml:mo>\n                        <\/mml:mrow>\n                      <\/mml:math>\n                    <\/jats:inline-formula>\n                    CEISTs in\n                    <jats:italic>\n                      LTQ\n                      <jats:sub>n<\/jats:sub>\n                      ,\n                    <\/jats:italic>\n                    the\n                    <jats:italic>n<\/jats:italic>\n                    -dimensional locally twisted cube. The proposed algorithm has been actually implemented, and we present the outputs. Network broadcasting in the\n                    <jats:italic>\n                      LTQ\n                      <jats:sub>n<\/jats:sub>\n                    <\/jats:italic>\n                    was simulated using\n                    <jats:inline-formula>\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\" overflow=\"scroll\">\n                        <mml:mrow>\n                          <mml:mo>\u230a<\/mml:mo>\n                          <mml:mrow>\n                            <mml:mrow>\n                              <mml:mfrac>\n                                <mml:mi>n<\/mml:mi>\n                                <mml:mn>2<\/mml:mn>\n                              <\/mml:mfrac>\n                            <\/mml:mrow>\n                          <\/mml:mrow>\n                          <mml:mo>\u230b<\/mml:mo>\n                        <\/mml:mrow>\n                      <\/mml:math>\n                    <\/jats:inline-formula>\n                    CEISTs, and the performance compared with broadcasting using a single tree.\n                  <\/jats:p>","DOI":"10.1177\/01692968241310647","type":"journal-article","created":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T09:57:47Z","timestamp":1747303067000},"page":"11-28","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":1,"title":["On Completely Edge-Independent Spanning Trees in Locally Twisted Cubes"],"prefix":"10.1177","volume":"193","author":[{"given":"Xiaorui","family":"Li","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Soochow University, Suzhou 215006, China, ,{chengbaolei,jxfan,wangyanme}@suda.edu.cn"}]},{"given":"Baolei","family":"Cheng","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Soochow University, Suzhou 215006, China, ,{chengbaolei,jxfan,wangyanme}@suda.edu.cn"}]},{"given":"Jianxi","family":"Fan","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Soochow University, Suzhou 215006, China, ,{chengbaolei,jxfan,wangyanme}@suda.edu.cn"}]},{"given":"Yan","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Soochow University, Suzhou 215006, China, ,{chengbaolei,jxfan,wangyanme}@suda.edu.cn"}]},{"given":"Dajin","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computing, Montclair State University, Upper Montclair, NJ 07043, USA"}]}],"member":"179","published-online":{"date-parts":[[2025,5,15]]},"reference":[{"key":"e_1_3_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.29465"},{"key":"e_1_3_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.485370"},{"key":"e_1_3_2_4_1","unstructured":"Bao F Funyu Y Hamada Y Igarashi Y. Reliable broadcasting and secure distributing in channel networks. Proceedings of the 1997 International Symposium on Parallel Architectures Algorithms and Networks (I-SPAN\u201997) 1997 pp. 472-478."},{"key":"e_1_3_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3591110"},{"key":"e_1_3_2_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(88)90213-1"},{"key":"e_1_3_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2006.12.001"},{"issue":"1","key":"e_1_3_2_8_1","first-page":"143","article-title":"Optimal independent spanning trees on hypercubes","volume":"20","author":"Tang S-M","year":"2004","unstructured":"Tang S-M, Wang Y-L, Leu Y. Optimal independent spanning trees on hypercubes. Journal of Information Science and Engineering, 2004, 20(1):143\u2013155.","journal-title":"Journal of Information Science and Engineering"},{"key":"e_1_3_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00033-2"},{"key":"e_1_3_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2003.1189580"},{"key":"e_1_3_2_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2021.04.024"},{"key":"e_1_3_2_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2005.05.009"},{"key":"e_1_3_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2017.2746344"},{"key":"e_1_3_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-018-0249-y"},{"key":"e_1_3_2_15_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.21857"},{"key":"e_1_3_2_16_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxab120"},{"key":"e_1_3_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.02.014"},{"key":"e_1_3_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2307871"},{"key":"e_1_3_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-023-05546-z"},{"key":"e_1_3_2_20_1","doi-asserted-by":"publisher","DOI":"10.1080\/0020716042000301752"},{"key":"e_1_3_2_21_1","volume-title":"Proceedings of the 13th International Conference on Parallel and Distributed Systems","author":"Hsieh S-Y","unstructured":"Hsieh S-Y, Wu C-Y, Lee C-W. Fault-free Hamiltonian cycles in locally twisted cubes under conditional edge faults. Proceedings of the 13th International Conference on Parallel and Distributed Systems, 2007, pp. 1-8."},{"key":"e_1_3_2_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.12.025"},{"key":"e_1_3_2_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.03.012"},{"key":"e_1_3_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-022-04825-5"},{"key":"e_1_3_2_25_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxs123"},{"key":"e_1_3_2_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2022.12.005"},{"key":"e_1_3_2_27_1","first-page":"41","article-title":"Relationship between extra connectivity and component connectivity in networks","volume":"833","author":"Li X","year":"2021","unstructured":"Li X, Lin C-K, Fan J, Jia X, Cheng B, Zhou J. Relationship between extra connectivity and component connectivity in networks. The Compute Journal, 2021, 833:41\u201355.","journal-title":"The Compute Journal"},{"key":"e_1_3_2_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.03.012"},{"issue":"1","key":"e_1_3_2_29_1","first-page":"84","article-title":"BC interconnection networks and their properties","volume":"26","author":"Fan J","year":"2003","unstructured":"Fan J, He L. BC interconnection networks and their properties. Chinese Journal of Computers, 2003, 26(1):84\u201390.","journal-title":"Chinese Journal of Computers"}],"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/01692968241310647","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/01692968241310647","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/01692968241310647","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T20:28:01Z","timestamp":1769718481000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/01692968241310647"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2]]},"references-count":28,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["10.1177\/01692968241310647"],"URL":"https:\/\/doi.org\/10.1177\/01692968241310647","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2]]}}}