Adjacency matrix.I want to simply the code .

clc;
clear all;
n = 10;
C= zeros(n, n);
C(1,n)=1;
C(1,n-1)=1;
C(2,n)=1;

A = zeros(n, n);

for i = 1:n
    for j = 1:n
        if j==i+1 || j == i + 2
            A(i,j) = 1;
        else
            A(i, j) = 0;
        end
    end
end
B1=A+C
B=B1+B1';


G=graph(B);
plot(G)

Answer 1

[Bruno Luong]

n = 10;
x=accumarray([2 3 n-1 n]',1);
B = toeplitz(x,x);
G=graph(B);
plot(G)

[mks]

How can I write a code when few node are connected five edges and some nodes are connected four,three and 2 edges .please help me on this .

[mks]

how can i rewired by replacing 2 edges at random then the code will be ?

Answer 2

[Walter Roberson]

You can get a fair bit of the way with

B1 = diag(ones(n-1,1),1) + diag(ones(n-2,1),2);

You will still need to do the upper right corner, but that is not difficult (use two more diag calls)