The number of 1's in each row of an incidence matrix of a graph G is equal to _____.

Related MCQs

• Each column of an incidence matrix of a graph G has exactly _______.
• The rank of the incidence matrix of any connected graph G with n vertices is ______.
• 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              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).
• To any graph G there corresponds a vertex in a matrix called ________matrix.
• Berge graph is similar to              due to strong perfect graph theorem.
• 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 _________.
• Each edge has one end in set X and one end in set Y then the graph (X, Y) is called _____graph.