68 views
Prove that the rank of the Adjacency Matrix which is associated with a $k-$ regular graph is $k.$
0

@ankitgupta.1729

just taking 2 regular of 4 vertex we can prove it

rt??

+2
If in IISc let's let's meet infront of CSA department at 5.
0

I am not there,I havenot got that chance

might be there

+1
what a question by professor !

Beautiful merging of 2 concepts :)
+1

@srestha mam,

just taking 2 regular of 4 vertex we can prove it

by taking examples we can not prove something...

for saying something is false, we can use one example, but for saying something is true, we can't do like that

0
So we have to use like mathematical induction ? or soem other concept ?
+1
yes....

taking any k-regular graph, i observed that, if we think in vector form, there are some vectors are repeating.

we are trying for rank, so by eliminating duplicates, i am getting as rank k.

Even this is also not formal proof

+1 vote
1
2