1) If a graph has 10 edges, the sum of degrees of all vertices is: a) 10 b) 20 c) 5 d) 15 2) In a simple graph, the maximum number of edges with 4 vertices is: a) 4 b) 6 c) 8 d) 12 3) A vertex with degree 1 is called: a) Isolated vertex b) Pendant vertex c) Regular vertex d) Cut vertex 4) A graph in which every pair of vertices is connected by an edge is called: a) Regular graph b) Complete graph c) Bipartite graph d) Null graph 5) The number of edges in a complete graph k5 is a) 5 b) 8 c) 10 d) 12 6) A graph is bipartite if it contains: a) Odd cycle b) Even cycle only c) Parallel edges d) Loop 7) The adjacency matrix of a simple graph is always: a) Symmetric b) Diagonal c) Identity matrix d) Null matrix 8) If all vertices of a graph have degree 2, the graph must be: a) Tree b) Cycle c) Complete d) Bipartite 9) Two graphs are isomorphic if they have: a) Same number of vertices only b) Same number of edges only c) Same structure d) Same labels 10) A connected graph with no cycles is called: a) Complete graph b) Tree c) Regular graph d) Bipartite graph 11) A graph with exactly two vertices of odd degree has: a) Euler circuit b) Euler path c) Hamilton circuit d) No path 12) A graph with all vertices of even degree has: a) Euler path only b) Euler circuit c) No Euler path d) Hamilton path 13) The number of edges in a complete bipartite graph k3,4 is a) 7 b) 12 c) 14 d) 24 14) A graph with 5 vertices each of degree 4 is: a) K5 b) Tree c) Cycle d) Bipartite 15) Removing a cut vertex will: a) Increase edges b) Disconnect the graph c) Make graph complete d) Form cycle 16) A bridge in a graph is an edge whose removal: a) Forms cycle b) Disconnects graph c) Increases degree d) Makes it complete 17) The incidence matrix of a graph relates: a) Vertex–vertex b) Edge–edge c) Vertex–edge d) Path–cycle 18) A graph with no edges is called: a) Complete graph b) Null graph c) Regular graph d) Connected graph 19) The degree of each vertex in K5 is: a) n b) n − 1 c) n + 1 d) 2n 20) A Hamilton path visits: a) Every edge once b) Every vertex once c) Every vertex twice d) Only odd vertices

graph

由
打印
嵌入

排行榜

视觉风格

选项

切换模板

恢复自动保存：？