The number of distinct simple graphs with up to three nodes is _________.

Related MCQs

• Number of distinct nodes in any elementary path of length p is ________.
• Triangle free graphs have the property of clique number is                      
• If a compound statement is made up of three simple statements then the number of rows in the truth table is _______.
• For the group Sn of all permutations of n distinct symbols, what is the number of elements in Sn?
• An isomorphism of graphs G and H is a bijection f the vertex sets of G and H. Such that any two vertices u and v of G are adjacent in G if and only if
• 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 proof broken into distinct cases, where these cases cover all prospects, such proofs are known as                        
• If there are n distinct components in a statement then there are _______ combinations of values in the truth table.
• There are only five distinct Hasse diagrams for partially ordered sets that contain _______elements.
• If the edges of a walk W are distinct then W is called _________.