Abstract

The development of effective ways of depicting the structure of finite graphs of large order forms a very active and dynamic area of research. In this article, we explore the use of colour parameterizations of the entries of graph distance matrices to depict the structure of graphs with vertex sets of large cardinality, producing many new works of mathematical art given by the application of colour processing functions on matrices of this form. Computer-generated works of art of this form often reveal interesting patterns concerning the corresponding graphs.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call