| Summary: | A series of counting, sequence and layer matrices are considered precursors of classifiers capable of providing the partitions of the vertices of graphs. Classifiers are given to provide different degrees of distinctiveness for the vertices of the graphs. Any partition can be represented with colors. Following this fundamental idea, it was proposed to color the graphs according to the partitions of the graph vertices. Two alternative cases were identified: when the order of the sets in the partition is relevant (the sets are distinguished by their positions) and when the order of the sets in the partition is not relevant (the sets are not distinguished by their positions). The two isomers of <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msub><mi>C</mi><mn>28</mn></msub></semantics></math></inline-formula> fullerenes were colored to test the ability of classifiers to generate different partitions and colorings, thereby providing a useful visual tool for scientists working on the functionalization of various highly symmetrical chemical structures.
|
|---|
