Back to Search
Start Over
A calculus for measuring the elegance of abstract graphs
- Source :
- Applied Mathematics and Computation. 320:142-148
- Publication Year :
- 2018
- Publisher :
- Elsevier BV, 2018.
-
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.
- Subjects :
- Graph rewriting
021103 operations research
Elegance
Applied Mathematics
media_common.quotation_subject
0211 other engineering and technologies
Voltage graph
010103 numerical & computational mathematics
02 engineering and technology
01 natural sciences
Computational Mathematics
Clique-width
Calculus
0101 mathematics
Null graph
Lattice graph
Graph property
Graph product
Mathematics
media_common
Subjects
Details
- ISSN :
- 00963003
- Volume :
- 320
- Database :
- OpenAIRE
- Journal :
- Applied Mathematics and Computation
- Accession number :
- edsair.doi...........155b7ae2fbb04c8f2aa8b0af40f9e2fd
- Full Text :
- https://doi.org/10.1016/j.amc.2017.09.023