Edges intersect only at their ends are called ________.

Related MCQs

• If two edges have same vertices as its terminal vertices those edges are called ____.
• The 2n vertices of a graph G corresponds to all subsets of a set of size n, for n>=4. Two vertices of G are adjacent if and only if the corresponding sets intersect in exactly two elements. The number of connected components in G can be                        
• A              is a graph which has the same number of edges as its complement must have number of vertices congruent to 4m or 4m modulo 4(for integral values of number of edges).
• Let G be a directed graph whose vertex set is the set of numbers from 1 to 50. There is an edge from a vertex i to a vertex j if and only if either j = i + 1 or j = 3i. Calculate the minimum number of edges in a path in G from vertex 1 to vertex 50.
• Any subset of edges that connects all the vertices and has minimum total weight, if all the edge weights of an undirected graph are positive is called                
• In a graph if few edges have directions and few do not have directions then the graph is called _________.
• If the edges of a walk W are distinct then W is called _________.
• An edge with identical ends is called _________.
• An edge with same ends is called ___________.
• If G is the forest with 54 vertices and 17 connected components, G has                total number of edges.