A                is a graph with no homomorphism to any proper subgraph.

Related MCQs

• A graph is              if and only if it does not contain a subgraph homeomorphic to k5 or k3,3.
• Berge graph is similar to              due to strong perfect graph theorem.
• 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              
• Let G be an arbitrary graph with v nodes and k components. If a vertex is removed from G, the number of components in the resultant graph must necessarily lie down between            and            
• 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 _________.
• 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                
• The rank of the incidence matrix of any connected graph G with n vertices is ______.
• To any graph G there corresponds a vertex in a matrix called ________matrix.
• The specification of proper construction of a sentence is called ______.