The Dominating set defination and Minimal dominating set definations given below

Code to generate the above.

A Function  F such that given the Graph G and vertex v as input the function should return me the number  of minimal dominating sets in the graph G contating the vertex v.

The logic to code seems to be above me Kind help some one please.

As manually doing is not that easy kind help.

I will surely acknowlege,

Kind help

I have list of lists I looking to Shuffle the entire List of lists in a very very non-sequencial manner everthing thing fully shuffled.

I tried but I am unable to find the right way.

Attached a code I tried

Code like below

toy_shuffle.mw

Inside a big running for loop 

If a particular condition is satisfied I want loop to pause until i again press the enter key again 

As if the condition is satisfied I want to note down the output results printed on screen when that condition is satisfied.

previously C I used to use like getch() for it to wait

Kind help please.

I dont want  breakpoint it will simply call the debugger so only.

I have a n cross n matrix M I need help to write a function f say which takes the Matrix M as input function and Normalize each column of independent data.

Here normalization is  subtract by mean and divide by Standard deviation kind help if possible

If anyone has  idea of other different types of normalization please help it will help me a lot 

Kind help your ideas will all be acknowledge Please help

I have say a

1) n cross n matrix A

2)  n cross 1 matrix B

I want to elementwise divide that is /~ each column of  by B and store in A itself like this 

If b_1 is in B and a_11 is in A i want   b_1/~a_11 in a_11

That is i divide

B /~ A first column

B /~ A second column

Like that for all its n columns

Kind help please