21. The number of elements in the adjacency matrix of a graph having 7 vertices is . . . . . . . .
22. What would be the Incidence Matrix of the given HyperGraph?
V = {x,y,z} E = {{x,y}{y}{x,z}{z,y}}
V = {x,y,z} E = {{x,y}{y}{x,z}{z,y}}
23. 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?
24. The column sum in an incidence matrix for a directed graph having no self loop is . . . . . . . .
25. Size of an And Inverter Graph is the number of . . . . . . . . gates and the number of logic levels is number of . . . . . . . . gates on the . . . . . . . . path from a primary input to a primary output.
26. If a Graph Structured Stack contains {1, 2, 3, 4} {1, 5, 3, 4} {1, 6, 7, 4} and {8, 9, 7, 4}, what would be the source and sink vertices of the DAC?
27. For the given conditions, which of the following is in the correct order of increasing space requirement?
i. Undirected, no weight
ii. Directed, no weight
iii. Directed, weighted
iv. Undirected, weighted
i. Undirected, no weight
ii. Directed, no weight
iii. Directed, weighted
iv. Undirected, weighted
28. With V(greater than 1) vertices, how many edges at most can a Directed Acyclic Graph possess?
29. MultiGraphs having self-loops are called PseudoGraphs?
30. Dijkstra's Algorithm will work for both negative and positive weights?
Read More Section(Graphs)
Each Section contains maximum 100 MCQs question on Graphs. To get more questions visit other sections.