I have a hard time to find a way to construct a
k-regular graph out of
n vertices. There seems to be a lot of theoretical material on regular graphs on the internet but I can't seem to extract construction rules for regular graphs.
My preconditions are
k<n and (n%2 == 0 or k%2 == 0)
Is an adjacency matrix the way to go here? If so, how would I use it?
Is this even a mathematical problem?