to generate Undirected regular graph

[hkaturu]

can anybody give an idea on how to solve this proble....

Need devise 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 help

thanks in advance

[mehdi62b]

I know just
N*D=2*q
(q=the numbers of edges)
so if N*D is an odd number we will not have any possible graph!

and rest of it :rolleyes: ...

[hkaturu]

hey mehdi thanks for your reply....can you explain a bit more....
thanks in advance

[mehdi62b]

Hello hkaturu,
hasnt your teacher solved this problem yet?:p
about thing I told you take a look at these examples
Suppose
n=5 & d=1
answer is :no possible graph!(n*d=5*1=5=an odd number so there is no answer)
n=6 & d=1
(ur unique answer) .___. .___. .____. (n*d=6*1=6=2*3 ... so in every possible graph there will be 3 edges,here you just had one graph)
I cant solve this problem in generally
I should think of it more :sick: