If a relation is reflexive then in the graph of a relation there must be a loop at _____.

Related MCQs

• If a relation is reflexive, then all the diagonal entries in the relation matrix must be________.
• If R is reflexive, symmetric and transitive then the relation is said to be ________.
• A relation R in X is said to be a ________, if it is reflexive and symmetric.
• 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            
• In a graph if few edges have directions and few do not have directions then the graph is called _________.
• 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              
• A path of a graph is said to be ______ if it contains all the edges of the graph.
• During a month with 30 days, a cricket team plays at least one game a day, but no more than 45 games. There must be a period of some number of consecutive days during which the team must play exactly               number of games.
• 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).