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

graph

autors:
Drukāt
Iegult

Līderu saraksts

Vizuālais stils

Iespējas

Pārslēgt veidni

)
Atjaunot automātiski saglabāto: ?