7 votes 7 votes Let $X$ be the adjacency matrix of a graph $G$ with no self loops. The entries along the principal diagonal of $X$ are all zeros all ones both zeros and ones different Graph Theory isro2007 graph-theory graph-connectivity + – go_editor asked Jun 10, 2016 • edited Jan 24 by makhdoom ghaya go_editor 3.7k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 8 votes 8 votes Answer : all Zeros It is not said that how many node should be there in graph take a graph with single node And it is also mentioned that there is no loop . shekhar chauhan answered Jun 10, 2016 • selected Jun 27, 2016 by Arjun shekhar chauhan comment Share Follow See 1 comment See all 1 1 comment reply thor commented Nov 29, 2016 reply Follow Share @vijaycs he answered it considering a particular case of 1 node. 1 votes 1 votes Please log in or register to add a comment.
1 votes 1 votes Consider 5X5 matrix, for 1,1 for 2,2, since there is no self loop so all diagonal will be 0 0 0 0 0 0 animesh answered Jul 1, 2016 animesh comment Share Follow See all 0 reply Please log in or register to add a comment.