{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:12:17Z","timestamp":1760242337579,"version":"build-2065373602"},"reference-count":58,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2017,5,6]],"date-time":"2017-05-06T00:00:00Z","timestamp":1494028800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Axioms"],"abstract":"<jats:p>In this exploratory paper, we discuss quantitative graph-theoretical measures of network aesthetics. Related work in this area has typically focused on geometrical features (e.g., line crossings or edge bendiness) of drawings or visual representations of graphs which purportedly affect an observer\u2019s perception. Here we take a very different approach, abandoning reliance on geometrical properties, and apply information-theoretic measures to abstract graphs and networks directly (rather than to their visual representaions) as a means of capturing classical appreciation of structural symmetry. Examples are used solely to motivate the approach to measurement, and to elucidate our symmetry-based mathematical theory of network aesthetics.<\/jats:p>","DOI":"10.3390\/axioms6020012","type":"journal-article","created":{"date-parts":[[2017,5,8]],"date-time":"2017-05-08T11:45:16Z","timestamp":1494243916000},"page":"12","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Toward Measuring Network Aesthetics Based on Symmetry"],"prefix":"10.3390","volume":"6","author":[{"given":"Zengqiang","family":"Chen","sequence":"first","affiliation":[{"name":"College of Computer and Control Engineering, Nankai University, Tianjin 300350, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Dehmer","sequence":"additional","affiliation":[{"name":"College of Computer and Control Engineering, Nankai University, Tianjin 300350, China"},{"name":"Department of Mechatronics and Biomedical Computer Science, University for Health Sciences,Medical Informatics and Technology (UMIT), 6060 Hall, Tyrol, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Emmert-Streib","sequence":"additional","affiliation":[{"name":"Predictive Medicine and Analytics Lab, Department of Signal Processing, Tampere University of Technology,33720 Tampere, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8254-505X","authenticated-orcid":false,"given":"Abbe","family":"Mowshowitz","sequence":"additional","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":"Yongtang","family":"Shi","sequence":"additional","affiliation":[{"name":"Center for Combinatorics and LPMC, Nankai University, Tianjin 300071, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2017,5,6]]},"reference":[{"key":"ref_1","unstructured":"Fucks, W. (1953). Mathematische Analyse des literarischen Stils. Studium Generale, Springer."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Ganter, B., and Mineau, G.W. (2000). Conceptual Structures: Logical, Linguistic, and Computational Issues, Springer. Lecture Notes in Artificial Intelligence.","DOI":"10.1007\/10722280"},{"key":"ref_3","unstructured":"Mehler, A. (2001). Textbedeutung. Zur Prozeduralen Analyse und Repr\u00e4sentation Struktureller \u00c4hnlichkeiten von Texten, Peter Lang. Sprache, Sprechen und Computer\/Computer Studies in Language and Speech."},{"key":"ref_4","unstructured":"Tuldava, J. (1995). A Statistical Method of Comparison of the Lexical Composition of Two Texts. Methods in Quantitative Linguistics, Wissenschaftlicher Verlag Trier."},{"key":"ref_5","first-page":"133","article-title":"A mathematical approach to aesthetics","volume":"50","author":"Birkhoff","year":"1931","journal-title":"Scientia (Milano)"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/1422765","article-title":"Birkhoff Revisited: Beauty as a Function of Effect and Means","volume":"98","author":"Boselie","year":"1985","journal-title":"Am. J. Psychol."},{"key":"ref_7","unstructured":"Reichardt, J. (1971). The Projects of Generative Aesthetics. Cybernetics, Art, and Ideas, New York Graphic Society."},{"key":"ref_8","unstructured":"Moles, A.A. (1966). Information Theory and Esthetic Perception, University of Illinois Press."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/MCG.2008.34","article-title":"Informational Aesthetics Measures","volume":"28","author":"Rigau","year":"2008","journal-title":"IEEE Comput. Graph. Appl."},{"key":"ref_10","unstructured":"Galanter, P. (2010, January 15\u201317). Complexity, Neuroaesthetics, and Computational Aesthetic Evaluation. Proceedings of the 13th Generative Art Conference GA2010, Milan, Italy."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1006\/jvlc.2002.0232","article-title":"Metrics for Graph Drawing Aesthetics","volume":"13","author":"Purchase","year":"2002","journal-title":"J. Vis. Lang. Comput."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Beck, F., Burch, M., and Diehl, S. (2009, January 15\u201317). Towards an Aesthetic Dimensions Framework for Dynamic Graph Visualisations. Proceedings of the 13-th International Conference Information Visualisation, Barcelona, Spain.","DOI":"10.1109\/IV.2009.42"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1057\/palgrave.ivs.9500013","article-title":"Cognitive Measurements of Graph Aesthetics","volume":"1","author":"Ware","year":"2002","journal-title":"Inf. Vis."},{"key":"ref_14","unstructured":"Battista, G.D., Eades, P., Tamassia, R., and Tollis, I.G. (1999). Algorithms for the Visualization of Graphs, Prentice Hall."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/j.amc.2007.05.058","article-title":"A comparative analysis of multidimensional features of objects resembling sets of graphs","volume":"196","author":"Dehmer","year":"2008","journal-title":"Appl. Math. Comput."},{"key":"ref_16","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_17","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1145\/146802.146826","article-title":"Structural Analysis of Hypertexts: Identifying Hierarchies and Useful Metrics","volume":"10","author":"Botafogo","year":"1992","journal-title":"ACM Trans. Inf. Syst."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1007\/s10910-013-0294-9","article-title":"Large-scale analysis of structural branching measures","volume":"52","author":"Schutte","year":"2013","journal-title":"J. Math. Chem."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Dehmer, M., and Emmert-Streib, F. (2014). Quantitative Graph Theory. Theory and Applications, CRC Press.","DOI":"10.1201\/b17645"},{"key":"ref_20","unstructured":"Todeschini, R., and Consonni, V. (2002). Handbook of Molecular Descriptors, Wiley-VCH."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF02476948","article-title":"Entropy and the complexity of the graphs I: An index of the relative complexity of a graph","volume":"30","author":"Mowshowitz","year":"1968","journal-title":"Bull. Math. Biophys."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Brillouin, L. (1956). Science and Information Theory, Academic Press.","DOI":"10.1063\/1.3059856"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF02477985","article-title":"Some order-disorder considerations in living systems","volume":"17","author":"Morowitz","year":"1953","journal-title":"Bull. Math. Biophys."},{"key":"ref_24","first-page":"129","article-title":"A note on the information content of graphs","volume":"18","author":"Trucco","year":"1956","journal-title":"Bull. Math. Biol."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF02477860","article-title":"Life, Information Theory, and Topology","volume":"17","author":"Rashevsky","year":"1955","journal-title":"Bull. Math. Biophys."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"767","DOI":"10.3390\/sym3040767","article-title":"Information Theory of Networks","volume":"3","author":"Dehmer","year":"2012","journal-title":"Symmetry"},{"key":"ref_27","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_28","doi-asserted-by":"crossref","unstructured":"Li, X., Shi, Y., and Gutman, I. (2012). Graph Energy, Springer.","DOI":"10.1007\/978-1-4614-4220-2"},{"key":"ref_29","unstructured":"Devillers, J., and Balaban, A.T. (2013). Circumscribed complexity in ecological networks. Advances in Network Complexity, Wiley-Blackwell."},{"key":"ref_30","unstructured":"Emmert-Streib, F., and Dehmer, M. (2010). Analysis of Microarray Data: A Network-Based Approach, Wiley VCH."},{"key":"ref_31","unstructured":"Diudea, M.V. (2001). QSPR \/ QSAR Studies by Molecular Descriptors, Nova Publishing."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1080\/00207728408926559","article-title":"Information theoretical analysis of ecological networks","volume":"15","author":"Hirata","year":"1984","journal-title":"Int. J. Syst. Sci."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/j.compbiolchem.2004.09.001","article-title":"Quantitative methods for ecological network analysis","volume":"28","author":"Ulanowicz","year":"2004","journal-title":"Comput. Biol. Chem."},{"key":"ref_34","unstructured":"Mehler, A., Sharoff, S., Rehm, G., and Santini, M. (2010). Mining Graph Patterns in Web-based Systems: A Conceptual View. Genres on the Web: Computational Models and Empirical Studies, Springer."},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Bunke, H., G\u00fcnter, S., and Jiang, X. (2001, January 11\u201314). Towards bridging the gap between statistical and structural pattern recognition: Two new concepts in graph matching. Proceedings of the Advances in Pattern Recognition\u2014ICAPR 2001, Rio de Janeiro, Brazil.","DOI":"10.1007\/3-540-44732-6_1"},{"key":"ref_36","unstructured":"Lobin, H., and Lemnitzer, L. (2004). Textmining. Texttechnologie. Perspektiven und Anwendungen, Stauffenburg."},{"key":"ref_37","first-page":"39","article-title":"A new method of measuring similarity for a special class of directed graphs","volume":"36","author":"Dehmer","year":"2007","journal-title":"Tatra Mt. Math. Publ."},{"key":"ref_38","first-page":"180","article-title":"Fifty years of graph matching, network alignment and network comparison","volume":"346\u2013347","author":"Dehmer","year":"2016","journal-title":"Inf. Sci."},{"key":"ref_39","unstructured":"Dehmer, M., Emmert-Streib, F., and Mehler, A. (2011). Social Ontologies as Generalized Nearly Acyclic Directed Graphs: A Quantitative Graph Model of Social Tagging. Towards an Information Theory of Complex Networks: Statistical Methods and Applications, Birkh\u00e4user."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0166-1280(94)04081-3","article-title":"Topological order in molecules 1. Molecular branching revisited","volume":"336","author":"Bonchev","year":"1995","journal-title":"J. Mol. Struct. THEOCHEM"},{"key":"ref_41","first-page":"199","article-title":"Analysis of asymmetry measures","volume":"2","author":"Garrido","year":"2008","journal-title":"Adv. Model. Optim."},{"key":"ref_42","first-page":"615","article-title":"Symmetry of Complex Networks","volume":"11","author":"Garrido","year":"2009","journal-title":"Adv. Model. Optim."},{"key":"ref_43","first-page":"321","article-title":"A Symmetry Index for Graphs","volume":"21","author":"Mowshowitz","year":"2010","journal-title":"Symmetry Cult. Sci."},{"key":"ref_44","unstructured":"Dehmer, M., Mehler, A., and Emmert-Streib, F. (2007, January 25\u201328). Graph-theoretical Characterizations of Generalized Trees. Proceedings of the International Conference on Machine Learning: Models, Technologies & Applications (MLMTA\u201907), Las Vegas, NV, USA."},{"key":"ref_45","unstructured":"(2017, January 12). Bahnh\u00f6fe des MVV. Available online: http:\/\/www.mvv-muenchen.de\/de\/netz-bahnhoefe\/bahnhofsinformation\/index.html."},{"key":"ref_46","unstructured":"Netzpl\u00e4ne des MVV (2017, January 12). Information des M\u00fcnchner Verkehrs- und Tarifverbundes GmbH. Available online: http:\/\/www.mvv-muenchen.de\/de\/netz-bahnhoefe\/netzplaene\/index.html."},{"key":"ref_47","doi-asserted-by":"crossref","unstructured":"Rodrigue, J.P., Comtois, C., and Slack, B. (2013). The Geography of Transport Systems, Taylor & Francis.","DOI":"10.4324\/9780203371183"},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"2834","DOI":"10.1093\/bioinformatics\/btu384","article-title":"NetBioV: An R package for visualizing large network data in biology and medicine","volume":"19","author":"Tripathi","year":"2014","journal-title":"Bioinformatics"},{"key":"ref_49","doi-asserted-by":"crossref","unstructured":"Emmert-Streib, F., and Dehmer, M. (2009). Information processing in the transcriptional regulatory network of yeast: Functional robustness. BMC Syst. Biol., 3.","DOI":"10.1186\/1752-0509-3-35"},{"key":"ref_50","doi-asserted-by":"crossref","unstructured":"Harary, F. (1969). Graph Theory, Addison Wesley Publishing Company.","DOI":"10.21236\/AD0705364"},{"key":"ref_51","doi-asserted-by":"crossref","unstructured":"Filonik, D., and Baur, D. (2009, January 15\u201317). Measuring aesthetics for information visualization. Proceedings of the 13th International Conference Information Visualisation, Barcelona, Spain.","DOI":"10.1109\/IV.2009.94"},{"key":"ref_52","first-page":"239","article-title":"Herstellung von Graphen mit vorgegebener abstrakter Gruppe","volume":"6","author":"Frucht","year":"1939","journal-title":"Compos. Math."},{"key":"ref_53","doi-asserted-by":"crossref","unstructured":"Dehmer, M., and Emmert-Streib, F. (2009). Entropy, orbits and spectra of graphs. Analysis of Complex Networks: From Biology to Linguistics, Wiley-VCH.","DOI":"10.1002\/9783527627981"},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF02476692","article-title":"Entropy and the complexity of graphs II: The information content of digraphs and infinite graphs","volume":"30","author":"Mowshowitz","year":"1968","journal-title":"Bull. Math. Biophys."},{"key":"ref_55","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_56","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1007\/BF02476673","article-title":"Entropy and the complexity of graphs IV: Entropy measures and graphical structure","volume":"30","author":"Mowshowitz","year":"1968","journal-title":"Bull. Math. Biophys."},{"key":"ref_57","unstructured":"McKay, B.D., and Piperno, A. (1970, January 01). Practical Graph Isomorphism, II, 2013. Available online: http:\/\/cs.anu.edu.au\/~bdm\/nauty\/."},{"key":"ref_58","doi-asserted-by":"crossref","unstructured":"Deza, M.M., and Deza, E. (2012). Encyclopedia of Distances, Springer. [2nd ed.].","DOI":"10.1007\/978-3-642-30958-8"}],"container-title":["Axioms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2075-1680\/6\/2\/12\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T18:34:52Z","timestamp":1760207692000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2075-1680\/6\/2\/12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,6]]},"references-count":58,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2017,6]]}},"alternative-id":["axioms6020012"],"URL":"https:\/\/doi.org\/10.3390\/axioms6020012","relation":{},"ISSN":["2075-1680"],"issn-type":[{"type":"electronic","value":"2075-1680"}],"subject":[],"published":{"date-parts":[[2017,5,6]]}}}