Test my Merit My Results Create Exam

Higher Study | Engineering Mathematics | Graph Theory

In a connected graph, a bridge is an edge whose removal disconnects a graph. Which one of the following statements is true?
Consider the pseudocode given below. The function DoSomething() takes as argument a pointer to the root of an arbitrary tree represented by the leftMostChild-rightSibling representation. Each node of the tree is of type treeNode. typedef struct treeNode* treeptr; struct treeNode {              treeptr leftMostChild, rightSibling; }; int DoSomething (treeptr tree) {              int value=0;              if (tree != NULL) {              if (tree->leftMostChild == NULL)              value = 1;    else               value = DoSomething(tree->leftMostChild);               value = value + DoSomething(tree->rightSibling);     }               return(value); } When the pointer to the root of a tree is passed as the argument to DoSomething, the value returned by the function corresponds to the 
Let G = (V, E) be a directed graph where V is the set of vertices and E the set of edges. Then which one of the following graphs has the same strongly connected components as G?
The following pie chart shows the population of 5 states of India in 2010. What is the population of Rajasthan if the total population of these 5 states is 16200000?
If G is a forest with n vertices and K connected components, then how many edges does G have?
Consider the following given figure in which the graph and tree (dotted) are shown: Choose the fundamental loops which include the set of lines.
If G is a forest with n vertices and k connected components, how many edges does G have?
What is the order of the adjacency matrix corresponding to a graph with ‘n’ nodes and ‘m’ edges?
The following simple undirected graph is referred to as the Peterson graph. Which of the following statements is/are TRUE?
The number of vertices in polyhedron which has 30 edges on 12 faces is
The degree sequence of a simple graph is the sequence of the degrees of the nodes in the graph in decreasing order. Which of the following sequences can not be the degree sequence of any graph? I. 7, 6, 5, 4, 4, 3, 2, 1 II. 6, 6, 6, 6, 3, 3, 2, 2 III. 7, 6, 6, 4, 4, 3, 2, 2 IV. 8, 7, 7, 6, 4, 2, 1, 1
K4 and Q3 are graphs with the following structures. Which one of the following statements is TRUE in relation to these graphs?
Which of the following graphs is isomorphic to
The line graph L(G) of a simple graph G is defined as follows: There is exactly one vertex v(e) in L(G) for each edge e in G. For any two edges e and e' in G, L(G) has an edge between v(e) and v(e'), if and only if e and e' are incident with the same vertex in G. Which of the following statements is/are TRUE? (P) The line graph of a cycle is a cycle. (Q) The line graph of a clique is a clique. (R) The line graph of a planar graph is planar. (S) The line graph of a tree is a tree.
Which of the given frequency polygons represents the following frequency distribution? Class 4 - 8 8 - 12 12 – 16 16 - 20 20 – 24 Frequency 2 4 5 3 2
Ads