{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:24:14Z","timestamp":1760239454440,"version":"build-2065373602"},"reference-count":12,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T00:00:00Z","timestamp":1605657600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006261","name":"Taif University","doi-asserted-by":"publisher","award":["TURSP-2020\/160"],"award-info":[{"award-number":["TURSP-2020\/160"]}],"id":[{"id":"10.13039\/501100006261","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>During the last two centuries, after the question asked by Euler concerning mutually orthogonal Latin squares (MOLS), essential advances have been made. MOLS are considered as a construction tool for orthogonal arrays. Although Latin squares have numerous helpful properties, for some factual applications these structures are excessively prohibitive. The more general concepts of graph squares and mutually orthogonal graph squares (MOGS) offer more flexibility. MOGS generalize MOLS in an interesting way. As such, the topic is attractive. Orthogonal arrays are essential in statistics and are related to finite fields, geometry, combinatorics and error-correcting codes. Furthermore, they are used in cryptography and computer science. In this paper, our current efforts have concentrated on the definition of the graph-orthogonal arrays and on proving that if there are k MOGS of order n, then there is a graph-orthogonal array, and we denote this array by G-OA(n2,k,n,2).\u00a0In addition, several new results for the orthogonal arrays obtained from the MOGS are given. Furthermore, we introduce a recursive construction method for constructing the graph-orthogonal arrays.<\/jats:p>","DOI":"10.3390\/sym12111895","type":"journal-article","created":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T06:23:52Z","timestamp":1605767032000},"page":"1895","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["On Graph-Orthogonal Arrays by Mutually Orthogonal Graph Squares"],"prefix":"10.3390","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2575-5103","authenticated-orcid":false,"given":"M.","family":"Higazy","sequence":"first","affiliation":[{"name":"Department of Mathematics and Statistics, College of Science, Taif University, P.O. Box 11099, Taif 21944, Saudi Arabia"},{"name":"Department of Physics and Engineering Mathematics, Faculty of Electronic Engineering, Menoufia University, Menouf 32952, Egypt"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2009-3905","authenticated-orcid":false,"given":"A.","family":"El-Mesady","sequence":"additional","affiliation":[{"name":"Department of Physics and Engineering Mathematics, Faculty of Electronic Engineering, Menoufia University, Menouf 32952, Egypt"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3976-9100","authenticated-orcid":false,"given":"M. S.","family":"Mohamed","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Statistics, College of Science, Taif University, P.O. Box 11099, Taif 21944, Saudi Arabia"},{"name":"Department of Mathematics, Faculty of Science, Al-Azher University, Nasr City 11884, Egypt"}]}],"member":"1968","published-online":{"date-parts":[[2020,11,18]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., and Murty, U.S.R. (1976). Graph Theory with Applications, Elsevier Science Publishing Co., Inc.","DOI":"10.1007\/978-1-349-03521-2"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., and Murty, U.S.R. (2008). Graph Theory, Springer.","DOI":"10.1007\/978-1-84628-970-5"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Higaz, M., El-Mesady, A., Mahmoud, E.E., and Alkinani, M.H. (2020). Circular intensely orthogonal double cover design of balanced complete multipartite graphs. Symmetry, 12.","DOI":"10.3390\/sym12101743"},{"key":"ref_4","unstructured":"Laywine, C.F., and Mullen, G.L. (1998). Discrete Mathematics Using Latin Squares, Wiley."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/S0378-3758(00)00276-7","article-title":"Mutually orthogonal latin squares: A brief survey of constructions","volume":"95","author":"Colbourn","year":"2001","journal-title":"J. Stat. Plan. Inference"},{"key":"ref_6","first-page":"83","article-title":"Mutually orthogonal graph squares for disjoint union of stars","volume":"149","year":"2020","journal-title":"ARS COMBINATORIA"},{"key":"ref_7","first-page":"89","article-title":"On mutually orthogonal disjoint copies of graph squares","volume":"36","year":"2016","journal-title":"Note di Matematica"},{"key":"ref_8","first-page":"303","article-title":"Mutually orthogonal graph squares for disjoint union of paths","volume":"12","author":"Shaaban","year":"2018","journal-title":"Appl. Math. Sci."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"7","DOI":"10.4236\/ojdm.2016.61002","article-title":"On mutually orthogonal graph-path squares","volume":"6","year":"2016","journal-title":"Open J. Discret. Math."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1002\/jcd.20216","article-title":"Mutually orthogonal graph squares","volume":"17","author":"Sampathkumar","year":"2009","journal-title":"J. Comb. Des."},{"key":"ref_11","unstructured":"El-Shanawany, R. (2001). Orthogonal Double Covers of Complete Bipartite Graphs. [Ph.D. Thesis, University of Rostock]."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Hedayat, A.S., Sloane, N.J.A., and Stuffken, J. (1999). Orthogonal Arrays: Theory and Applications, Springer.","DOI":"10.1007\/978-1-4612-1478-6"}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/12\/11\/1895\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T10:34:01Z","timestamp":1760178841000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/12\/11\/1895"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,18]]},"references-count":12,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2020,11]]}},"alternative-id":["sym12111895"],"URL":"https:\/\/doi.org\/10.3390\/sym12111895","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2020,11,18]]}}}