# Number of k-stars in an adjacency matrix

조회 수: 3(최근 30일)
Daniel Stocks 2021년 1월 25일
댓글: Daniel Stocks 2021년 1월 28일
Hi all,
I have an nxn adjacency matrix of a graph and want to know the number of unique 2-stars, 3-stars and triangles in the graph, is there a function I can use to do this or do code my own method?
I have to code my own method any advise on how to proceed would be appreciated.
Thank you

댓글을 달려면 로그인하십시오.

### 답변(1개)

Gaurav Garg 2021년 1월 28일
Hi Daniel,
Even though you can find such patterns easily in 1-D arrays by converting them to strings (link1 and link2), it would be better if you can write such pattern funcitons for 2-D arrays.
for i=1:r
for j=1:c
end
end
function check_for_triangle(r, c)
is_present = false;
if A(r,c) == 1
if A(r+1,c) == 1 & A(r+1,c+1) == 1
if A(r+2,c) == 1 & A(r+2,c+1) == 1 & A(r+2,c+2) == 1
is_present = true;
end
end
end
end
The above given pseudo-code is an example of how you can write code pattern to check for a triangle in a binary adjacency matrix.
##### 댓글 수: 1표시숨기기 없음
Daniel Stocks 2021년 1월 28일
Thank you Gaurav I will look into this

댓글을 달려면 로그인하십시오.

### Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!