Hello everybody,
can anybody give an idea on how to solve this problem....
I need an algorithm to generate all possible undirected regular graph having N nodes and degree D.
an undirected regular graph of degree D is one in which all nodes have same degree D
any help, ideas...will be appreciated
Thanks in advance.
--------------------------------------------
Mehdi.:)