Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

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 following statements regarding tree are correct? (A) All the links of a tree together does not constitute the complement of the corresponding tree (B) A connected subgraph of a connected graph is a tree if there exist (n - 1) nodes of the group (C) A connected subgraph of a connected graph is a tree if there exist many paths between any pair of nodes in it (D) The number of terminal nodes of end vertices of every tree are atleast two (E) Every connected graph has atleast one tree Choose the correct answer from the options given below: (1) (A) and (B) only (2) (B) and (C) only (3) (B) and (D) only (4) (D) and (E) only
Given a plane graph, G having 2 connected component, having 6 vertices, 7 edges and 4 regions. What will be the number of connected components?
For a connected planar simple graph G=(V, E) with e=|E|=16 and v=|V|=9, then find the number of regions that are created when drawing a planar representation of the graph?
What is the number of vertices in an undirected connected graph with 39 edges, 7 vertices of degree 2, 2 vertices of degree 5 and remaining of degree 6?
If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is ___________
An undirected graph has 8 vertices labelled 1, 2, …,8 and 31 edges. Vertices 1, 3, 5, 7 have degree 8 and vertices 2, 4, 6, 8 have degree 7. What is the degree of vertex 8?
Suppose a database schedule 5 involves transactions T1, T2, .............Tn Consider the precedence graph of S with vertices representing the transactions and edges representing the conflicts. If S is serializable, which one of the following orderings of the vertices of the precedence graph is guaranteed to yield a serial schedule ?
Suppose a database schedule S involves transactions T1, …,Tn. Construct the precedence graph of S with vertices representing the transactions and edges representing the conflicts. If S is serializable, which one of the following orderings of the vertices of the precedence graph is guaranteed to yield a serial schedule? 
Seven people A, B, C, D, E, F and G live on separate floors of a 7-floor building. Ground floor is numbered 1, first floor is numbered. 2 and so on until the topmost floor is numbered 7. Each one of these having a different cars-Cadillac, Ambassador, Fiat, Maruti, Mercedes, Bedford and Fargo but not necessarily in the same order. Only three people live above the floor on which A lives. Only one person lives between A and the one having a car Cadillac. F lives immediately below the one having a car Bedford. The one having a car Bedford lives on an even-numbered floor. Only three people live between the ones having a car Cadillac and Maruti. E lives immediately above C. E is not having a car Maruti. Only two people live between B and the one having a car Fargo. The one having a car Fargo lives below the floor on which B lives. The one having a car Fiat does not live immediately above D or immediately below B. D does not live immediately above or immediately below A. G does not have a car Ambassador. Question : How many people live between the floors on which D and the one having a car Bedford ?