Each column of an incidence matrix of a graph G has exactly _______.

Related MCQs

• The number of 1's in each row of an incidence matrix of a graph G is equal to _____.
• The rank of the incidence matrix of any connected graph G with n vertices is ______.
• 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?
• 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              
• 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                        
• The problem of finding a path in a graph that visits every vertex exactly once is called?
• To any graph G there corresponds a vertex in a matrix called ________matrix.
• Berge graph is similar to              due to strong perfect graph theorem.
• 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.