if you want to remove an article from website contact us from top.

# what is the maximum number of possible non zero values in an adjacency matrix of a simple graph with n vertices?

Category :

### Mohammed

Guys, does anyone know the answer?

get what is the maximum number of possible non zero values in an adjacency matrix of a simple graph with n vertices? from screen.

## What is the maximum number of possible non zero values in an adjacency matrix of a simple graph with n vertices?

What is the maximum number of possible non zero values in an adjacency matrix of a simple graph with n vertices? (a) (n ... (c) n*(n-1) (d) n*(n+1)

## What is the maximum number of possible non zero values in an adjacency matrix of a simple graph with n vertices?

← Prev Question Next Question →

← Prev Question Next Question →

## Find MCQs & Mock Test

Free JEE Main Mock Test

Free NEET Mock Test

Class 12 Chapterwise MCQ Test

Class 11 Chapterwise Practice Test

Class 10 Chapterwise MCQ Test

Class 9 Chapterwise MCQ Test

Class 8 Chapterwise MCQ Test

Class 7 Chapterwise MCQ Test

## Related questions

स्रोत : www.sarthaks.com

## What is the maximum number of possible non zero values in an adjacency matrix of a simple graph with n vertices?

Click here👆to get an answer to your question ✍️ What is the maximum number of possible non zero values in an adjacency matrix of a simple graph with n vertices?

Question

A

B

C

D

## n*(n+1)

Medium Open in App Solution Verified by Toppr

Correct option is C)

30 1

स्रोत : www.toppr.com

This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Adjacency Matrix”. 1. The number of elements in the adjacency matrix of a graph having 7 vertices is __________ a) 7 b) 14 c) 36 d) 49 2. What would be the number of zeros in the adjacency matrix of the given ... Read more

« Prev Next »

This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Adjacency Matrix”.

1. The number of elements in the adjacency matrix of a graph having 7 vertices is __________

2. What would be the number of zeros in the adjacency matrix of the given graph?

3. Adjacency matrix of all graphs are symmetric.

Sanfoundry Certification Contest of the Month is Live. 100+ Subjects. Participate Now!

4. The time complexity to calculate the number of edges in a graph whose information in stored in form of an adjacency matrix is ____________

5. For the adjacency matrix of a directed graph the row sum is the _________ degree and the column sum is the ________ degree.

Check this: Design & Analysis of Algorithms MCQ | Programming MCQs

6. What is the maximum number of possible non zero values in an adjacency matrix of a simple graph with n vertices?

7. On which of the following statements does the time complexity of checking if an edge exists between two particular vertices is not, depends?

a) Depends on the number of edges

b) Depends on the number of vertices

c) Is independent of both the number of edges and vertices

d) It depends on both the number of edges and vertices

8. In the given connected graph G, what is the value of rad(G) and diam(G)?

9. Which of these adjacency matrices represents a simple graph?

a) [ [1, 0, 0], [0, 1, 0], [0, 1, 1] ]

b) [ [1, 1, 1], [1, 1, 1], [1, 1, 1] ]

c) [ [0, 0, 1], [0, 0, 0], [0, 0, 1] ]

d) [ [0, 0, 1], [1, 0, 1], [1, 0, 0] ]

10. Given an adjacency matrix A = [ [0, 1, 1], [1, 0, 1], [1, 1, 0] ], The total no. of ways in which every vertex can walk to itself using 2 edges is ________

11. If A[x+3][y+5] represents an adjacency matrix, which of these could be the value of x and y.

12. Two directed graphs(G and H) are isomorphic if and only if A=PBP-1, where P and A are adjacency matrices of G and H respectively.

13. Given the following program, what will be the 3rd number that’d get printed in the output sequence for the given input?

#include

using namespace std;

deque

int cur=0; int G[10][10]; bool visited[10];

q;for(int i=0;i

void fun(int n); int main() { int num=0; int n; cin>>n;

for(int j=0;jfor(int i=0;i

cin>>G[i][j];

cout<

visited[i]=false; fun(n); return 0; } void fun(int n) {

for(int j=0;j

visited[cur]=true; q.push_back(cur); do {

{

if(G[cur][j]==1 && !visited[j])

cout<

{ q.push_back(j);

14. For which type of graph, the given program won’t run infinitely? The Input would be in the form of an adjacency Matrix and n is its dimension (1

visited[j]=true; } } q.pop_front(); if(!q.empty()) cur=q.front(); }while(!q.empty()); } Input Sequence:- 9 0 1 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 1 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 1 0 1 1 0 0 0 0 1 0 1 0 0 1 0 1 0 0 0 1 0 0 a) 2 b) 6 c) 8 d) 4 View Answer

#include

using namespace std;

for(int i=0;i

int G[10][10]; void fun(int n); int main() { int num=0; int n; cin>>n;

for(int j=0;jfor(int i=0;i

cin>>G[i][j]; fun(n); return 0; } void fun(int n) {

for(int j=0;j

if(G[i][j]==1) j--; }

a) All Fully Connected Graphs

b) All Empty Graphs

c) All Bipartite Graphs

d) All simple graphs

15. Given the following adjacency matrix of a graph(G) determine the number of components in the G.

[0 1 1 0 0 0], [1 0 1 0 0 0], [1 1 0 0 0 0], [0 0 0 0 1 0], [0 0 0 1 0 0], [0 0 0 0 0 0]. a) 1 b) 2 c) 3 d) 4 View Answer

Sanfoundry Global Education & Learning Series – Data Structure.

To practice all areas of Data Structure, here is complete set of 1000+ Multiple Choice Questions and Answers.

स्रोत : www.sanfoundry.com

Do you want to see answer or more ?
Mohammed 7 day ago

Guys, does anyone know the answer?