F(X,Y,Z,M) = X`Y`Z`M`. The degree of the function is                  

Related MCQs

• Let D be a simple graph on 10 vertices such that there is a vertex of degree 1, a vertex of degree 2, a vertex of degree 3, a vertex of degree 4, a vertex of degree 5, a vertex of degree 6, a vertex of degree 7, a vertex of degree 8 and a vertex of degree 9. What can be the degree of the last vertex?
• 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?
• 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              
• If each and every vertex in G has degree at most 23 then G can have a vertex colouring of                      
• If each and every vertex in G has degree at most 23 then G can have a vertex colouring of                      
• For a graph of degree three, in what time can a Hamiltonian path be found?
• There are                    numbers of Boolean functions of degree n.
• Any vertex having degree one is called _______.
• A graph in which every vertex has same degree is called _________graph.
• The number of vertices of odd degree in a graph is always________.