{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T10:57:45Z","timestamp":1762253865784,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T00:00:00Z","timestamp":1626998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T00:00:00Z","timestamp":1626998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"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":[[2021,11]]},"DOI":"10.1007\/s00373-021-02375-w","type":"journal-article","created":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T11:02:56Z","timestamp":1627038176000},"page":"2511-2519","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The Antistrong Property for Special Digraph Families"],"prefix":"10.1007","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3506-2450","authenticated-orcid":false,"given":"Lili","family":"Yuan","sequence":"first","affiliation":[]},{"given":"Jixiang","family":"Meng","sequence":"additional","affiliation":[]},{"given":"Eminjan","family":"Sabir","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,23]]},"reference":[{"key":"2375_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 Verlag, London (2009)","edition":"2"},{"key":"2375_CR2","first-page":"41","volume":"51","author":"G Chartrand","year":"1997","unstructured":"Chartrand, G., Gavlas, H., Schultz, M., Wall, C.E.: Anticonnected digraphs. Util. Math. 51, 41\u201354 (1997)","journal-title":"Util. Math."},{"key":"2375_CR3","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":"2375_CR4","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":"2375_CR5","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0012-365X(94)00377-U","volume":"155","author":"S Klav\u017ear","year":"1996","unstructured":"Klav\u017ear, S.: Coloring graph products\u2013a survey. Discrete Math. 155, 135\u2013145 (1996)","journal-title":"Discrete Math."},{"key":"2375_CR6","doi-asserted-by":"crossref","unstructured":"Stadler, B.M.R., Stadler, P.F.: The topology of evolutionary biology. In: Modelling in Molecular Biology, Springer, pp. 267\u2013286 (2004)","DOI":"10.1007\/978-3-642-18734-6_12"},{"key":"2375_CR7","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1006\/jtbi.2003.3150","volume":"220","author":"G Wagner","year":"2003","unstructured":"Wagner, G., Stadler, P.F.: Quasi-independence, homology and the unity of type: a topological theory of characters. J. Theoret. Biol. 220, 505\u2013527 (2003)","journal-title":"J. Theoret. Biol."},{"issue":"2","key":"2375_CR8","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1109\/TVCG.2007.46","volume":"13","author":"D Archambault","year":"2007","unstructured":"Archambault, D., Munzner, T., Auber, D.: TopoLayout: multilevel graph layout by topological features. IEEE Trans. Vis. Comput. Graph. 13(2), 305\u2013317 (2007)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"6","key":"2375_CR9","doi-asserted-by":"publisher","first-page":"1082","DOI":"10.1109\/TVCG.2010.217","volume":"16","author":"S J\u00e4nicke","year":"2010","unstructured":"J\u00e4nicke, S., Heine, C., Hellmuth, M., Stadler, P., Scheuermann, G.: Visualization of graph products. IEEE Trans. Vis. Comput. Graph. 16(6), 1082\u20131089 (2010)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"2375_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-1565-7","volume-title":"Optimal Analysis of Structures by Concepts of Symmetry and Regularity","author":"A Kaveh","year":"2013","unstructured":"Kaveh, A.: Optimal Analysis of Structures by Concepts of Symmetry and Regularity. Springer, Berlin (2013)"},{"issue":"11\u201312","key":"2375_CR11","doi-asserted-by":"publisher","first-page":"1219","DOI":"10.1016\/j.compstruc.2007.11.005","volume":"86","author":"A Kaveh","year":"2008","unstructured":"Kaveh, A., Koohestani, K.: Graph products for configuration processing of space structures. Comput. Struct. 86(11\u201312), 1219\u20131231 (2008)","journal-title":"Comput. Struct."},{"issue":"11","key":"2375_CR12","doi-asserted-by":"publisher","first-page":"1797","DOI":"10.1002\/nme.1126","volume":"61","author":"A Kaveh","year":"2004","unstructured":"Kaveh, A., Rahami, H.: An efficient method for decomposition of regular structures using graph products. Internat J. Numer. Methods Eng. 61(11), 1797\u20131808 (2004)","journal-title":"Internat J. Numer. Methods Eng."},{"key":"2375_CR13","doi-asserted-by":"publisher","DOI":"10.1201\/b10959","volume-title":"Handbook of Product Graphs","author":"R Hammack","year":"2011","unstructured":"Hammack, R., Imrich, W., Klav\u017ear, S.: Handbook of Product Graphs, 2nd edn. CRC Press, Boca Roton (2011)","edition":"2"},{"key":"2375_CR14","volume-title":"Product Graphs","author":"W Imrich","year":"2000","unstructured":"Imrich, W., Klav\u017ear, S.: Product Graphs. Wiley-Intersci. Ser. Discrete Math. Optim. Wiley-Interscience, New York (2000)"},{"key":"2375_CR15","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0096-3003(98)10041-3","volume":"102","author":"WS Chiue","year":"1999","unstructured":"Chiue, W.S., Shieh, B.S.: On connectivity of the cartesian product of two graphs. Appl. Math. Comput. 102, 129\u2013137 (1999)","journal-title":"Appl. Math. Comput."},{"key":"2375_CR16","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1016\/j.aml.2007.06.010","volume":"21","author":"S \u0160pacapan","year":"2008","unstructured":"\u0160pacapan, S.: Connectivity of Cartesian products of graphs. Appl. Math. Lett. 21, 682\u2013685 (2008)","journal-title":"Appl. Math. Lett."},{"key":"2375_CR17","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0012-365X(92)90593-5","volume":"101","author":"E Gy\u00f6ri","year":"1992","unstructured":"Gy\u00f6ri, E., Plummer, M.: The cartesian product of a $$k$$-extendable and an $$l$$-extendable graph is $$(k + l + 1)$$-extendable. Discrete Math. 101, 87\u201396 (1992)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02375-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-021-02375-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02375-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T11:17:22Z","timestamp":1699269442000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-021-02375-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,23]]},"references-count":17,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["2375"],"URL":"https:\/\/doi.org\/10.1007\/s00373-021-02375-w","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2021,7,23]]},"assertion":[{"value":"12 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 June 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 July 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 July 2021","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"}}]}}