# ISRO2007-62

1.8k views

Let $X$ be the adjacency matrix of a graph $G$ with no self loops. The entries along the principal diagonal of $X$ are

1. all zeros
2. all ones
3. both zeros and ones
4. different

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 .

selected by
1
@vijaycs he answered it considering a particular case of 1 node.
1 vote

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

## Related questions

1
2.6k views
If a graph requires $k$ different colours for its proper colouring, then the chromatic number of the graph is 1 k k-1 k/2
2
1.9k views
A graph with $n$ vertices and $n-1$ edges that is not a tree, is Connected Disconnected Euler A circuit
3
3.2k views
Djikstra&rsquo;s algorithm is used to Create LSAs Flood an internet with information Calculate the routing tables Create a link state database