51. 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 . . . . . . . .
52. All Graphs have unique representation on paper.
53. 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<n<10).
#include <bits/stdc++.h>
using namespace std;
int G[10][10];
void fun(int n);
int main()
{
int num=0;
int n;
cin>>n;
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
cin>>G[i][j];
fun(n);
return 0;
}
void fun(int n)
{
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
if(G[i][j]==1)
j--;
}
#include <bits/stdc++.h>
using namespace std;
int G[10][10];
void fun(int n);
int main()
{
int num=0;
int n;
cin>>n;
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
cin>>G[i][j];
fun(n);
return 0;
}
void fun(int n)
{
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
if(G[i][j]==1)
j--;
}54. Which of the following is a HyperGraph, where V is the set of vertices, E is the set of edges?
55. What is the number of edges present in a complete graph having n vertices?
56. Graph Structured Stack finds its application in . . . . . . . .
57. What are the dimensions of an incidence matrix?
58. What is the number of unlabeled simple directed graph that can be made with 1 or 2 vertices?
59. Which of the following statement is true.
60. Incidence matrix and Adjacency matrix of a graph will always have same dimensions?
Read More Section(Graphs)
Each Section contains maximum 100 MCQs question on Graphs. To get more questions visit other sections.