search
Log In
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
5 votes
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
in Graph Theory 1.8k views

2 Answers

7 votes
 
Best answer

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 .


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
Answer:

Related questions

5 votes
2 answers
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
asked Jun 10, 2016 in Graph Theory jothee 2.6k views
8 votes
2 answers
2
1.9k views
A graph with $n$ vertices and $n-1$ edges that is not a tree, is Connected Disconnected Euler A circuit
asked Jun 10, 2016 in Graph Theory jothee 1.9k views
11 votes
3 answers
3
3.2k views
Djikstra’s algorithm is used to Create LSAs Flood an internet with information Calculate the routing tables Create a link state database
asked Jun 10, 2016 in Algorithms jothee 3.2k views
5 votes
4 answers
4
2.7k views
Which of the following models used for software reliability Waterfall Musa COCOMO Rayleigh
asked Jun 10, 2016 in IS&Software Engineering jothee 2.7k views
...