Context
Graph Theory is a cool field in mathematics concerned with studying structures called graphs. I could not find a website to calculate the minimum dominating set of a graph, and thus decided to make my own. This started as a very niche site to calculate the domination number of a nxn pawn graph, but I decided that a more general calculator could be better. It's made with sigma.js, graphology, and rust in web assembly. Hope you like it :))
Input a graph
How to use
Please input a vertex and edge set in standard graph theory notation. For example:
Example:
Vertex set:
{A, B, C, D, E, F}
Edge set:
{(A, B), (A, C), (B, D), (C, E), (D, F)}
Note: depending on the size of the graph calculation can take a good while. To be honest, I have not been patient enough to wait for the calculation of any graph with over 25 nodes. Take that into account, the program can be slow for large graphs
Once loaded though, the dominating set will be labelled in the graph with green