A calculus for measuring the elegance of abstract graphs
From MaRDI portal
Publication:2422969
DOI10.1016/j.amc.2017.09.023zbMath1426.05168OpenAlexW2761229765MaRDI QIDQ2422969
Abbe Mowshowitz, Matthias Dehmer
Publication date: 21 June 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2017.09.023
entropygraph constructiongraph aestheticsgraph elegancehydrocarbon treesinformation content of graphs
Cites Work
- A history of graph entropy measures
- Information processing in complex networks: Graph entropy and information functionals
- On the eigenvalues of trees
- Graph complexity and the laplacian matrix in blocked experiments
- On Graph Complexity
- Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
- Entropy and the complexity of graphs: II. The information content of digraphs and infinite graphs
- Entropy and the complexity of graphs: III. Graphs with prescribed information content
- Entropy and the complexity of graphs: IV. Entropy measures and graphical structure
- Asymmetric graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A calculus for measuring the elegance of abstract graphs