A calculus for measuring the elegance of abstract graphs

Abbe Mowshowitz and Matthias Dehmer

Applied Mathematics and Computation, 2018, vol. 320, issue C, 142-148

Abstract: This paper introduces a system for measuring the elegance of a graph based on the steps needed to build the graph and on its symmetry structure. The measure is designed to capture the essence of the notion of elegance in mathematics, namely, simplicity and clarity. The term “elegance” is used instead of “aesthetics” to distinguish the measure from those dependent on visual representation of a graph. Elegance is based solely on the abstract properties of a graph. A framework for measurement is defined and applied in a special case.

Keywords: Graph elegance; Graph aesthetics; Graph construction; Entropy; Information content of graphs; Hydrocarbon trees (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300317306446
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:320:y:2018:i:c:p:142-148

DOI: 10.1016/j.amc.2017.09.023

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().