{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T07:05:44Z","timestamp":1770966344884,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T00:00:00Z","timestamp":1767571200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T00:00:00Z","timestamp":1767571200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1007\/s00373-025-03008-2","type":"journal-article","created":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T13:33:03Z","timestamp":1767619983000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Period-3 Orbits of Sequential Dynamical Systems and Their Relationship to Error-Correcting Codes over Finite Fields"],"prefix":"10.1007","volume":"42","author":[{"given":"Tu\u011f\u00e7e","family":"Uluta\u015f","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9173-4944","authenticated-orcid":false,"given":"Mehmet Emin","family":"K\u00f6ro\u011flu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,5]]},"reference":[{"key":"3008_CR1","doi-asserted-by":"crossref","unstructured":"Defant, C.: Binary codes and period-2 orbits of sequential dynamical systems. Discrete Mathematics and Theoretical Computer Science 19, (Combinatorics) (2017)","DOI":"10.23638\/DMTCS-19-3-10"},{"key":"3008_CR2","volume-title":"An Introduction to Sequential Dynamical Systems","author":"H Mortveit","year":"2007","unstructured":"Mortveit, H., Reidys, C.: An Introduction to Sequential Dynamical Systems. Springer, New York (2007)"},{"issue":"2\u20133","key":"3008_CR3","first-page":"121","volume":"107","author":"CL Barrett","year":"2000","unstructured":"Barrett, C.L., Mortveit, H.S., Reidys, C.M.: Elements of a theory of simulation II: sequential dynamical systems. Appl. Math. Comput. 107(2\u20133), 121\u2013136 (2000)","journal-title":"Appl. Math. Comput."},{"key":"3008_CR4","first-page":"325","volume":"122","author":"C Barret","year":"2002","unstructured":"Barret, C., Mortveit, H., Reidys, C.: Elements of a theory of computer simulation III. Appl. Math. Comput. 122, 325\u2013340 (2002)","journal-title":"Appl. Math. Comput."},{"issue":"2\u20133","key":"3008_CR5","first-page":"241","volume":"98","author":"CL Barrett","year":"1999","unstructured":"Barrett, C.L., Reidys, C.M.: Elements of a theory of computer simulation I: sequential CA over random graphs. Appl. Math. Comput. 98(2\u20133), 241\u2013259 (1999)","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"3008_CR6","first-page":"500","volume":"174","author":"LD Garcia","year":"2006","unstructured":"Garcia, L.D., Jarrah, A.S., Laubenbacher, R.: Sequential dynamical systems over words. Appl. Math. Comput. 174(1), 500\u2013510 (2006)","journal-title":"Appl. Math. Comput."},{"key":"3008_CR7","doi-asserted-by":"publisher","first-page":"410","DOI":"10.4153\/CJM-1960-035-0","volume":"12","author":"R Read","year":"1960","unstructured":"Read, R.: The number of k-coloured graphs on labelled nodes. Can. J. Math. 12, 410\u2013414 (1960)","journal-title":"Can. J. Math."},{"key":"3008_CR8","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.ins.2017.05.002","volume":"409","author":"JA Aledo","year":"2017","unstructured":"Aledo, J.A., Diaz, L.G., Martinez, S., Valverde, J.C.: On periods and equilibria of computational sequential systems. Inf. Sci. 409, 27\u201334 (2017)","journal-title":"Inf. Sci."},{"issue":"1","key":"3008_CR9","first-page":"197","volume":"160","author":"WY Chen","year":"2005","unstructured":"Chen, W.Y., Li, X., Zheng, J.: Matrix method for linear sequential dynamical systems on digraphs. Appl. Math. Comput. 160(1), 197\u2013212 (2005)","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"3008_CR10","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1006\/aama.1998.0595","volume":"21","author":"C Reidys","year":"1998","unstructured":"Reidys, C.: Acyclic orientations of random graphs. Adv. Appl. Math. 21(2), 181\u2013192 (1998)","journal-title":"Adv. Appl. Math."},{"issue":"1\u20133","key":"3008_CR11","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0012-365X(97)00201-X","volume":"184","author":"CD Savage","year":"1998","unstructured":"Savage, C.D., Zhang, C.-Q.: The connectivity of acyclic orientation graphs. Discret. Math. 184(1\u20133), 281\u2013287 (1998)","journal-title":"Discret. Math."},{"issue":"1\u20133","key":"3008_CR12","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/0012-365X(94)00222-5","volume":"138","author":"DB West","year":"1995","unstructured":"West, D.B.: Acyclic orientations of complete bipartite graphs. Discret. Math. 138(1\u20133), 393\u2013396 (1995)","journal-title":"Discret. Math."},{"key":"3008_CR13","unstructured":"Galay, R., Kalistratov, D.: A new algebraic approach to the graph isomorphism and clique problems. arXiv:1905.08033 (2019)"},{"key":"3008_CR14","unstructured":"Davis, B.: Unlabelling signed graph colorings and acyclic orientations. Master Thesis, San Francisco State University, https:\/\/matthbeck.github.io\/teach\/masters\/brian.pdf (2014)"},{"issue":"7","key":"3008_CR15","doi-asserted-by":"publisher","first-page":"407","DOI":"10.3103\/S0146411610070060","volume":"44","author":"S Berlov","year":"2010","unstructured":"Berlov, S.: Relationships between the clique number, chromatic number, and the degree for some graphs. Autom. Control. Comput. Sci. 44(7), 407\u2013414 (2010)","journal-title":"Autom. Control. Comput. Sci."},{"issue":"1","key":"3008_CR16","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/s00022-023-00709-y","volume":"115","author":"M Kwiatkowski","year":"2024","unstructured":"Kwiatkowski, M., Pankov, M.: On maximal cliques in the graph of simplex codes. J. Geom. 115(1), 10 (2024)","journal-title":"J. Geom."},{"issue":"2","key":"3008_CR17","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1088\/0951-7715\/22\/2\/010","volume":"22","author":"M Macauley","year":"2009","unstructured":"Macauley, M., Mortveit, H.S.: Cycle equivalence of graph dynamical systems. Nonlinearity 22(2), 421 (2009)","journal-title":"Nonlinearity"},{"issue":"3","key":"3008_CR18","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1006\/aama.2000.0717","volume":"26","author":"R Laubenbacher","year":"2001","unstructured":"Laubenbacher, R., Pareigis, B.: Equivalence relations on finite dynamical systems. Adv. Appl. Math. 26(3), 237\u2013251 (2001)","journal-title":"Adv. Appl. Math."},{"issue":"1","key":"3008_CR19","first-page":"153","volume":"134","author":"CL Barrett","year":"2003","unstructured":"Barrett, C.L., Mortveit, H.S., Reidys, C.M.: ETS IV: sequential dynamical systems: fixed points, invertibility and equivalence. Appl. Math. Comput. 134(1), 153\u2013171 (2003)","journal-title":"Appl. Math. Comput."},{"key":"3008_CR20","first-page":"515","volume":"79","author":"S Mallik","year":"2021","unstructured":"Mallik, S., Yildiz, B.: Graph theoretic aspects of minimum distance and equivalence of binary linear codes. Australas. J Comb. 79, 515\u2013526 (2021)","journal-title":"Australas. J Comb."},{"issue":"21","key":"3008_CR21","doi-asserted-by":"publisher","first-page":"215303","DOI":"10.1088\/1751-8113\/45\/21\/215303","volume":"45","author":"AB Klimov","year":"2012","unstructured":"Klimov, A.B., Munoz, C., S\u00e1nchez-Soto, L.L.: Graph states in phase space. J. Phys. A: Math. Theor. 45(21), 215303 (2012)","journal-title":"J. Phys. A: Math. Theor."},{"issue":"11","key":"3008_CR22","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.3390\/e21111118","volume":"21","author":"A Mowshowitz","year":"2019","unstructured":"Mowshowitz, A., Dehmer, M., Emmert-Streib, F.: A note on graphs with prescribed orbit structure. Entropy 21(11), 1118 (2019)","journal-title":"Entropy"},{"key":"3008_CR23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511987045","volume-title":"A Course in Combinatorics","author":"JH Van Lint","year":"2001","unstructured":"Van Lint, J.H., Wilson, R.M.: A Course in Combinatorics. Cambridge University Press, New York (2001)"},{"key":"3008_CR24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511755279","volume-title":"Coding Theory: A First Course","author":"S Ling","year":"2004","unstructured":"Ling, S., Xing, C.: Coding Theory: A First Course. Cambridge University Press, New York (2004)"},{"issue":"12","key":"3008_CR25","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1016\/j.ipl.2015.07.001","volume":"115","author":"M Milshtein","year":"2015","unstructured":"Milshtein, M.: A new binary code of length 16 and minimum distance $$3$$. Inf. Process. Lett. 115(12), 975\u2013976 (2015)","journal-title":"Inf. Process. Lett."},{"key":"3008_CR26","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.jcss.2022.01.004","volume":"126","author":"F Bridoux","year":"2022","unstructured":"Bridoux, F., Durbec, A., Perrot, K., Richard, A.: Complexity of fixed point counting problems in Boolean networks. J. Comput. Syst. Sci. 126, 138\u2013164 (2022)","journal-title":"J. Comput. Syst. Sci."},{"key":"3008_CR27","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.tcs.2014.06.042","volume":"559","author":"S Wu","year":"2014","unstructured":"Wu, S., Adiga, A., Mortveit, H.S.: Limit cycle structure for dynamic bi-threshold systems. Theoret. Comput. Sci. 559, 34\u201341 (2014)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"3008_CR28","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0166-218X(93)90140-J","volume":"45","author":"P Sol\u00e9","year":"1993","unstructured":"Sol\u00e9, P., Zaslavsky, T.: The covering radius of the cycle code of a graph. Discret. Appl. Math. 45(1), 63\u201370 (1993)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"3008_CR29","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF02523189","volume":"17","author":"N Alon","year":"1997","unstructured":"Alon, N., Yuster, R., Zwick, U.: Finding and counting given length cycles. Algorithmica 17(3), 209\u2013223 (1997)","journal-title":"Algorithmica"},{"key":"3008_CR30","doi-asserted-by":"crossref","unstructured":"Barrett, C., Hunt, M., Marathe, M., Ravi, S., Rosenkrantz, D., Stearns, R., Tosic, P.: Gardens of Eden and fixed points in sequential dynamical systems. Discrete Mathematics & Theoretical Computer Science (Proceedings) (2001)","DOI":"10.46298\/dmtcs.2294"},{"key":"3008_CR31","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-70107-2","volume-title":"Graph Theory","author":"R Diestel","year":"2025","unstructured":"Diestel, R.: Graph Theory, vol. 173. Springer, Berlin (2025)"},{"key":"3008_CR32","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory, vol. 2. Prentice Hall, Upper Saddle River, NJ (2001)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-03008-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-03008-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-03008-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T06:05:17Z","timestamp":1770962717000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-03008-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,5]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,2]]}},"alternative-id":["3008"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-03008-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,5]]},"assertion":[{"value":"21 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}],"article-number":"14"}}