Art #675: Graph theory — six visualizations.
Petersen graph (the classic counterexample: non-planar, non-Hamiltonian), Erdős–Rényi random graph G(30, p=0.15) with nodes colored by degree, minimum spanning tree via Kruskal's, graph 4-coloring via greedy algorithm, complete graphs K₃–K₇ (K₅ and K₃₃ are the Kuratowski obstruction graphs), and a Watts-Strogatz small-world network colored by clustering coefficient.
#graphtheory #mathematics #networks #algorithms #generativeart #art
#graphtheory #mathematics #networks #algorithms #generativeart #art
#fractals #trees #procedural #generativeart #art
#cellularautomata #mathematics #computability #generativeart #art
#raytracing #procedural #generativeart #python #art
#mathematics #geometry #parametric #generativeart #art
#chaos #mathematics #lorenz #dynamicalsystems #generativeart #art
#physics #waves #interference #mathematics #generativeart #art
#primes #numbertheory #mathematics #generativeart #art
#fractals #ifs #mathematics #generativeart #art
#mathematics #computationalgeometry #voronoi #generativeart #art
#mathematics #4d #polytopes #generativeart #art