{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T11:06:26Z","timestamp":1762254386531,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T00:00:00Z","timestamp":1676505600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T00:00:00Z","timestamp":1676505600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100009110","name":"Natural Science Foundation of Xinjiang Province","doi-asserted-by":"publisher","award":["2020D04046","2021D01C116"],"award-info":[{"award-number":["2020D04046","2021D01C116"]}],"id":[{"id":"10.13039\/100009110","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s00373-023-02620-4","type":"journal-article","created":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T13:03:06Z","timestamp":1676552586000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Necessary and Sufficient Conditions for Circulant Digraphs to be Antistrong, Weakly-Antistrong and Anti-Eulerian"],"prefix":"10.1007","volume":"39","author":[{"given":"Lili","family":"Yuan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6853-8163","authenticated-orcid":false,"given":"Jixiang","family":"Meng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,16]]},"reference":[{"key":"2620_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-998-1","volume-title":"Digraphs: Theory, Algorithms and Applications","author":"J Bang-Jensen","year":"2009","unstructured":"Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications, 2nd edn. Springer, London (2009)","edition":"2"},{"key":"2620_CR2","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.jctb.2016.05.004","volume":"122","author":"J Bang-Jensen","year":"2017","unstructured":"Bang-Jensen, J., Bessy, S., Jackson, B., Kriesell, M.: Antistrong digraphs. J. Combin. Theory Ser. B 122, 68\u201390 (2017)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2620_CR3","first-page":"41","volume":"51","author":"G Chartrand","year":"1997","unstructured":"Chartrand, G., Gavlas, H., Schultz, M., Wall, C.: Anticonnected digraphs. Util. Math. 51, 41\u201354 (1997)","journal-title":"Util. Math."},{"key":"2620_CR4","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1002\/jgt.3190100103","volume":"10","author":"E Dobson","year":"1986","unstructured":"Dobson, E.: Connectivity of circulant digraphs. J. Graph Theory 10, 9\u201314 (1986)","journal-title":"J. Graph Theory"},{"key":"2620_CR5","doi-asserted-by":"publisher","first-page":"6047","DOI":"10.1016\/j.disc.2007.11.024","volume":"308","author":"E Dobson","year":"2008","unstructured":"Dobson, E.: On isomorphisms of circulant digraphs of bounded degree. Disc. Math. 308, 6047\u20136055 (2008)","journal-title":"Disc. Math."},{"key":"2620_CR6","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0095-8956(71)90035-9","volume":"11","author":"B Gr\u00fcnbaum","year":"1971","unstructured":"Gr\u00fcnbaum, B.: Antidirected Hamiltonian paths in tournaments. J. Combin. Theory Ser. B 11, 249\u2013257 (1971)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2620_CR7","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s00373-020-02234-0","volume":"37","author":"Y Hu","year":"2021","unstructured":"Hu, Y., Wei, Y.: Rainbow antistrong connection in tournaments. Graphs Comb. 37, 167\u2013181 (2021)","journal-title":"Graphs Comb."},{"key":"2620_CR8","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/s00373-007-0725-0","volume":"23","author":"X Liang","year":"2007","unstructured":"Liang, X., Meng, J., Zhang, Z.: Super-connectivity and hyper-connectivity of vertex transitive bipartite graphs. Graphs Comb. 23, 309\u2013314 (2007)","journal-title":"Graphs Comb."},{"key":"2620_CR9","unstructured":"Lu, Z.: On the automorphism groups of bi-cayley graphs. Acta. Sci. Nat. Univ. Pekinensis. 39 (2003)"},{"key":"2620_CR10","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/BF02665228","volume":"9","author":"J Meng","year":"1994","unstructured":"Meng, J., Huang, Q.: Isomorphisms of circulant diagaphs. Appl. Math. A J. Chin. Univ. 9, 405\u2013409 (1994)","journal-title":"Appl. Math. A J. Chin. Univ."},{"key":"2620_CR11","unstructured":"Park, J.H., Chwa, K.Y.: Recursive circulant : a new topology for multicomputers networks. Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN). IEEE. 73-80 (1994)"},{"key":"2620_CR12","volume-title":"Introduction of Finite Groups II","author":"M Xu","year":"1999","unstructured":"Xu, M.: Introduction of Finite Groups II. Science Press, Beijing (1999)"},{"key":"2620_CR13","doi-asserted-by":"publisher","first-page":"2511","DOI":"10.1007\/s00373-021-02375-w","volume":"37","author":"L Yuan","year":"2021","unstructured":"Yuan, L., Meng, J., Sabir, E.: The antistrong property for special digraph families. Graphs Comb. 37, 2511\u20132519 (2021)","journal-title":"Graphs Comb."},{"key":"2620_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2021.126513","volume":"411","author":"B Zhang","year":"2021","unstructured":"Zhang, B., Wu, B.: Anti-Eulerian digraphs. Appl. Math. Comput. 411, 126513 (2021)","journal-title":"Appl. Math. Comput."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02620-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-023-02620-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02620-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,12]],"date-time":"2023-04-12T17:04:41Z","timestamp":1681319081000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-023-02620-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,16]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["2620"],"URL":"https:\/\/doi.org\/10.1007\/s00373-023-02620-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2023,2,16]]},"assertion":[{"value":"8 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 December 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 January 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"22"}}