The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+2 votes
68 views
Prove that the rank of the Adjacency Matrix which is associated with a $k-$ regular graph is $k.$
asked in Graph Theory by Boss (13.2k points) | 68 views
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 

@ankitgupta.1729  

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

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
49,532 questions
54,123 answers
187,320 comments
71,044 users