The maximum number of edges in a 8- node undirected graph without self loops is

Related MCQs

• Maximum number of edges in an n-node undirected graph without self loops is ____.
•              is the maximum number of edges in an acyclic undirected graph with k vertices.
• G is a simple undirected graph and some vertices of G are of odd degree. Add a node n to G and make it adjacent to each odd degree vertex of G. The resultant graph is              
• 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?
• A graph that has neither self loops nor parallel edges is called_____graph.
• 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).
• 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                
• An undirected graph G has bit strings of length 100 in its vertices and there is an edge between vertex u and vertex v if and only if u and v differ in exactly one bit position. Determine the ratio of the chromatic number of G to the diameter of G?
• A path of a graph is said to be ______ if it contains all the edges of the graph.
• In a graph if few edges have directions and few do not have directions then the graph is called _________.