{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:41:48Z","timestamp":1771026108540,"version":"3.50.1"},"reference-count":12,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2019,11,15]],"date-time":"2019-11-15T00:00:00Z","timestamp":1573776000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>This paper presents a proof of the existence of connected, undirected graphs with prescribed orbit structure, giving an explicit construction procedure for these graphs. Trees with prescribed orbit structure are also investigated.<\/jats:p>","DOI":"10.3390\/e21111118","type":"journal-article","created":{"date-parts":[[2019,11,15]],"date-time":"2019-11-15T11:25:56Z","timestamp":1573817156000},"page":"1118","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Note on Graphs with Prescribed Orbit Structure"],"prefix":"10.3390","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8254-505X","authenticated-orcid":false,"given":"Abbe","family":"Mowshowitz","sequence":"first","affiliation":[{"name":"Department of Computer Science, The City College of New York (CUNY), 138th Street at Convent Avenue, New York, NY 10031, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Dehmer","sequence":"additional","affiliation":[{"name":"Steyr School of Management, University of Applied Sciences Upper Austria, 4600 Wels, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Emmert-Streib","sequence":"additional","affiliation":[{"name":"Predictive Medicine and Data Analytics Lab, Department of Signal Processing, Tampere University of Technology, 33720 Tampere, Finland"},{"name":"Institute of Biosciences and Medical Technology, Tampere University, 33520 Tampere, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,11,15]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF02476603","article-title":"Entropy and the complexity of graphs III: Graphs with prescribed information content","volume":"30","author":"Mowshowitz","year":"1968","journal-title":"Bull. Math. Biophys."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.ins.2010.08.041","article-title":"A History of Graph Entropy Measures","volume":"1","author":"Dehmer","year":"2011","journal-title":"Inf. Sci."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"559","DOI":"10.3390\/e14030559","article-title":"Entropy and the Complexity of Graphs Revisited","volume":"14","author":"Mowshowitz","year":"2012","journal-title":"Entropy"},{"key":"ref_4","unstructured":"Biggs, N. (1994). Algebraic Graph Theory, Cambridge University Press."},{"key":"ref_5","first-page":"321","article-title":"A Symmetry Index for Graphs","volume":"21","author":"Mowshowitz","year":"2010","journal-title":"Symmetry Cult. Sci."},{"key":"ref_6","unstructured":"Todeschini, R., and Consonni, V. (2008). Handbook of Molecular Descriptors, John Wiley & Sons."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Bonchev, D., and Rouvray, D.H. (2005). Complexity in Chemistry, Biology, and Ecology, Springer. Mathematical and Computational Chemistry.","DOI":"10.1007\/b136300"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1021\/ci00012a003","article-title":"Graph Automorphism Perception Algorithms in Computer- Enhanced Structure Elucidation","volume":"33","author":"Razinger","year":"1993","journal-title":"J. Chem. Inf. Comput. Sci."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1021\/ci60022a013","article-title":"Algorithms for Unique and Unambiguous Coding and Symmetry Perception of Molecular Structure Diagram, I. Vector Functions for Automorphism Partitioning","volume":"20","author":"Uchino","year":"1980","journal-title":"J. Chem. Inf. Comput. Sci."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Mowshowitz, A., and Mitsou, V. (2009). Entropy, Orbits and Spectra of Graphs. Anal. Complex Netw. Biol. Linguist., 1\u201322. Available online: https:\/\/onlinelibrary.wiley.com\/doi\/abs\/10.1002\/9783527627981#page=19.","DOI":"10.1002\/9783527627981.ch1"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Harary, F. (1969). Graph Theory, Addison Wesley Publishing Company.","DOI":"10.21236\/AD0705364"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Dehmer, M., Chen, Z., Emmert-Streib, F., Mowshowitz, A., Varmuza, K., Jodlbauer, H., Shi, Y., Triphati, S., and Tao, J. (2019). The Orbit-polynomial: A novel Measure of Symmetry in Graphs. IEEE Access, submitted for publication.","DOI":"10.1109\/ACCESS.2020.2970059"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/21\/11\/1118\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:34:42Z","timestamp":1760189682000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/21\/11\/1118"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,15]]},"references-count":12,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2019,11]]}},"alternative-id":["e21111118"],"URL":"https:\/\/doi.org\/10.3390\/e21111118","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,15]]}}}