{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:09:29Z","timestamp":1753884569832,"version":"3.41.2"},"reference-count":12,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11761071","11861068"],"award-info":[{"award-number":["11761071","11861068"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11771039","11771443"],"award-info":[{"award-number":["11771039","11771443"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11761071","11861068"],"award-info":[{"award-number":["11761071","11861068"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2022,3]]},"abstract":"<jats:p> For a digraph [Formula: see text], if [Formula: see text] contains a spanning closed trail, then [Formula: see text] is supereulerian. If for any pairs vertices [Formula: see text] and [Formula: see text] of [Formula: see text], [Formula: see text] contains both a spanning [Formula: see text]-trail and a spanning [Formula: see text]-trail, then [Formula: see text] is strongly trail-connected. If [Formula: see text] is a strongly trail-connected digraph, then [Formula: see text] is a supereulerian digraph. Algefari et al. proved that every symmetrically connected digraph and every partially symmetric digraph are supereulerian. In this paper, we prove that every symmetrically connected digraph and every partially symmetric digraph are strongly trail-connected digraphs. <\/jats:p>","DOI":"10.1142\/s0219265921420160","type":"journal-article","created":{"date-parts":[[2022,1,17]],"date-time":"2022-01-17T15:22:12Z","timestamp":1642432932000},"source":"Crossref","is-referenced-by-count":0,"title":["Trail-Connected Digraphs with Given Local Structures"],"prefix":"10.1142","volume":"22","author":[{"given":"Juan","family":"Liu","sequence":"first","affiliation":[{"name":"School of Big Data Statistics, Guizhou University of Finance and Economics, Guiyang 550025, P. R. China"}]},{"given":"Hong","family":"Yang","sequence":"additional","affiliation":[{"name":"College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang 830046, P. R. China"}]},{"given":"Hong-Jian","family":"Lai","sequence":"additional","affiliation":[{"name":"Department of Mathematics, West Virginia University, Morgantown, WV 26506, USA"}]},{"given":"Xindong","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, Xinjiang Normal University, Urumqi 830017, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2022,1,15]]},"reference":[{"doi-asserted-by":"publisher","key":"S0219265921420160BIB001","DOI":"10.1016\/j.ipl.2015.12.008"},{"doi-asserted-by":"publisher","key":"S0219265921420160BIB002","DOI":"10.1002\/jgt.21885"},{"doi-asserted-by":"publisher","key":"S0219265921420160BIB003","DOI":"10.1016\/j.dam.2017.11.030"},{"key":"S0219265921420160BIB004","volume-title":"Digraphs: Theory, Algorithms and Applications","author":"Bang-Jensen J.","year":"2010","edition":"2"},{"doi-asserted-by":"publisher","key":"S0219265921420160BIB005","DOI":"10.1002\/jgt.21810"},{"doi-asserted-by":"publisher","key":"S0219265921420160BIB006","DOI":"10.1016\/j.disc.2020.112129"},{"doi-asserted-by":"publisher","key":"S0219265921420160BIB007","DOI":"10.1007\/978-1-84628-970-5"},{"doi-asserted-by":"publisher","key":"S0219265921420160BIB008","DOI":"10.1016\/j.amc.2019.124964"},{"doi-asserted-by":"publisher","key":"S0219265921420160BIB009","DOI":"10.1016\/j.disc.2014.04.018"},{"doi-asserted-by":"publisher","key":"S0219265921420160BIB010","DOI":"10.1016\/j.amc.2020.125595"},{"doi-asserted-by":"publisher","key":"S0219265921420160BIB011","DOI":"10.1016\/0095-8956(80)90061-1"},{"doi-asserted-by":"publisher","key":"S0219265921420160BIB012","DOI":"10.1002\/jgt.22240"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265921420160","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,22]],"date-time":"2022-03-22T13:05:53Z","timestamp":1647954353000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219265921420160"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,15]]},"references-count":12,"journal-issue":{"issue":"01","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["10.1142\/S0219265921420160"],"URL":"https:\/\/doi.org\/10.1142\/s0219265921420160","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"type":"print","value":"0219-2659"},{"type":"electronic","value":"1793-6713"}],"subject":[],"published":{"date-parts":[[2022,1,15]]},"article-number":"2142016"}}