K n has n(n − 1)/2 edges (a triangular number), and is a regular graph of degree n − 1. Graph with N vertices may have up to C (N,2) = (N choose 2) = N* (N-1)/2 edges (if loops aren't allowed). Is there a geometric progression or other formula that can help? B 2n - 1 . The meta-lesson is that teachers can also make mistakes, or worse, be lazy and copy things from a website. However, three of those Hamilton circuits are the … . An n-vertex self-complementary graph has exactly half number of edges of the complete graph, i.e., n(n − 1)/4 edges, and (if there is more than one vertex) it must have diameter either 2 or 3. The 3 graphs are {1-2, 3}, {2-3, 1}, {1-3, 2}. & {\text { c) } 4… Give the gift of Numerade. Since n(n −1) must be divisible by 4, n must be congruent to 0 or 1 mod 4; for instance, a 6-vertex graph cannot be self-complementary. Figure 1: An exhaustive and irredundant list. Expert Answer . Découvrez comment nous utilisons vos informations dans notre Politique relative à la vie privée et notre Politique relative aux cookies. Solved: How many graphs exist with n vertices? How many trees are there spanning all the vertices in Figure 1? If P < M then the answer will be 0 as the extra edges can not be left alone. Thus, at least one of n and m must be odd. . The complete graph above has four vertices, so the number of Hamilton circuits is: (N – 1)! 3. (c)Find a simple graph with 5 vertices that is isomorphic to its own complement. All complete graphs are their own maximal cliques. De nition: A complete graph is a graph with N vertices and an edge between every two vertices. b) 3? Figure 1: A four-vertex complete graph K4. Now we deal with 3-regular graphs on6 vertices. (Start with: how many edges must it have?) Given two integers N and M, the task is to count the number of simple undirected graphs that can be drawn with N vertices and M edges.A simple graph is a graph that does not contain multiple edges and self loops. How many nonisomorphic simple graphs are there with n vertices, when n. is: a) 2, b) 3, c) 4? d) 1 , 1 , 1 , 1 , 4 Compare this number with the number of trees with vertices v 1 , . Contrary to what your teacher thinks, it's not possible for a simple, undirected graph to even have $\frac{n(n-1)}{2}+1$ edges (there can only be at most $\binom{n}{2} = \frac{n(n-1)}{2}$ edges). Find all non-isomorphic trees with 5 vertices. The meta-lesson is that teachers can also make mistakes, or worse, be lazy and copy things from a website. Given two integers N and M, the task is to count the number of simple undirected graphs that can be drawn with N vertices and M edges. Circulant graphs. 047_E.pdf - Chapter 10.4 Problem 47E Problem How many nonisomorphic connected simple graphs arc there with n vertices when n is a 2 b 3 c 4 d 5 Since n(n −1) must be divisible by 4, n must be congruent to 0 or 1 mod 4; for instance, a 6-vertex graph … 4. In the following gzipped tar files are text files with names of the form circ..txt containing the circulant graphs with n vertices and degree d. Each graph is given on one line as a set S of d integers. = (4 – 1)! That’s how many pairs of vertices there are. Show activity on this post. Solution: Since there are 10 possible edges, Gmust have 5 edges. C 2n - 2 . Prüfer sequences yield a bijective proof of Cayley's formula. Complete Graphs Let N be a positive integer. A graph with vertices 0,1,...,n-1 is circulant if the permutation (0,1,...,n-1) is an automorphism. Approach: The N vertices are numbered from 1 to N.As there is no self loops or multiple edges, the edge must be present between two different vertices. I Every two vertices share exactly one edge. I There are no loops. Kindly Prove this by induction. Definition − A graph (denoted as G = (V, E)) consists of a non-empty set of vertices or nodes V and a set of edges E. Writing code in comment? An n-vertex self-complementary graph has exactly half number of edges of the complete graph, i.e., n(n − 1)/4 edges, and (if there is more than one vertex) it must have diameter either 2 or 3. Don’t stop learning now. Chapter 10.4, Problem 47E Problem How many nonisomorphic connected simple graphs arc there with n vertices when n is a) 2? They are maximally connected as the only vertex cut which disconnects the graph is the complete set of vertices. = 3*2*1 = 6 Hamilton circuits. Inorder Tree Traversal without recursion and without stack! For 2 vertices there are 2 graphs. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready. How do I use this for n vertices i.e. A Eulerian graph has at most two vertices of odd degree. By signing up, you'll get thousands of step-by-step solutions to your homework questions. & {\text { c) } 4… They are listed in Figure 1. [BB] How many graphs have n vertices labeled v 1 , v 2 , . Answer to: In a complete graph of N vertices, there are 1/2 ( N -1)! Stack Exchange Network Stack Exchange network consists of 176 Q&A communities including Stack Overflow , the largest, most trusted online community for developers to learn, share their knowledge, and build their careers. How many nonisomorphic connected simple graphs are there with n vertices when n is \begin{array}{llll}{\text { a) } 2 ?} So, degree of each vertex is (N-1). A simple graph is a graph that does not contain multiple edges and self loops. Don't be tricked by the visual arrangement of a graph, i.e., cuts that are restricted to a plane. Many proofs of Cayley's tree formula are known. Prüfer sequences yield a bijective proof of Cayley's formula. I am not sure whether there are standard and elegant methods to arrive at the answer to this problem, but I would like to present an approach which I believe should work out. Q. Prim’s & Kruskal’s algorithm run on a graph G and produce MCST T P and T K, respectively, and T P is different from T K. Find true statement? Nos partenaires et nous-mêmes stockerons et/ou utiliserons des informations concernant votre appareil, par l’intermédiaire de cookies et de technologies similaires, afin d’afficher des annonces et des contenus personnalisés, de mesurer les audiences et les contenus, d’obtenir des informations sur les audiences et à des fins de développement de produit. B ... 12 A graph with n vertices will definitely have a parallel edge or self loop if the total number of edges are A greater than n–1 . – Andrew Mao Feb 21 '13 at 17:45 c) 4? One commonly encountered type is the Eulerian graph, all of whose edges are visited exactly once in a single path.Such a path is known as an Eulerian path.It turns out that it is quite easy to rule out many graphs as non-Eulerian by the following simple rule:. The following two graphs have both degree sequence (2,2,2,2,2,2) and they are not isomorphic because one is connected and the other one is not. How many edge are there in MCST generated from graph with 'n' vertices. Expert Answer . (c) 24 edges and all vertices of the same degree. Many proofs of Cayley's tree formula are known. This question hasn't been answered yet Ask an expert. And that any graph with 4 edges would have a Total Degree (TD) of 8. Output: 3 Recall the way to find out how many Hamilton circuits this complete graph has. , v n and n - 1 edges? spanning trees. How many vertices will the following graphs have if they contain: (a) 12 edges and all vertices of degree 3. The complement graph of a complete graph is an empty graph. Now we deal with 3-regular graphs on6 vertices. In mathematics, and more specifically in graph theory, a vertex (plural vertices) or node is the fundamental unit of which graphs are formed: an undirected graph consists of a set of vertices and a set of edges (unordered pairs of vertices), while a directed graph consists of a set of vertices and a set of arcs (ordered pairs of vertices). Assume it P. a. Thus, it is the binomial coefficient, C(V(V-1)/2,N) or (V(V-1)/2) (N) /N!. Number of Simple Graph with N Vertices and M Edges, Minimum number of edges between two vertices of a graph using DFS, Minimum number of edges between two vertices of a Graph, Ways to Remove Edges from a Complete Graph to make Odd Edges, Largest subset of Graph vertices with edges of 2 or more colors, Find K vertices in the graph which are connected to at least one of remaining vertices, Construct a graph using N vertices whose shortest distance between K pair of vertices is 2, Maximize the number of uncolored vertices appearing along the path from root vertex and the colored vertices, Maximum number of edges that N-vertex graph can have such that graph is Triangle free | Mantel's Theorem, Find the remaining vertices of a square from two given vertices, Count number of edges in an undirected graph, Maximum number of edges to be added to a tree so that it stays a Bipartite graph, Program to find total number of edges in a Complete Graph, Maximum number of edges among all connected components of an undirected graph, Maximum number of edges in Bipartite graph, Minimum number of Edges to be added to a Graph to satisfy the given condition, Maximum number of edges to be removed to contain exactly K connected components in the Graph, Calculate number of nodes between two vertices in an acyclic Graph by Disjoint Union method, Calculate number of nodes between two vertices in an acyclic Graph by DFS method, Shortest path with exactly k edges in a directed and weighted graph, Program to find the diameter, cycles and edges of a Wheel Graph, Tree, Back, Edge and Cross Edges in DFS of Graph, Shortest path with exactly k edges in a directed and weighted graph | Set 2, Maximum and minimum isolated vertices in a graph, Finding in and out degrees of all vertices in a graph, Data Structures and Algorithms – Self Paced Course, We use cookies to ensure you have the best browsing experience on our website. We know that a tree (connected by definition) with 5 vertices has to have 4 edges. So the graph is (N-1) Regular. the general case. Don't be tricked by the visual arrangement of a graph, i.e., cuts that are restricted to a plane. n/2 - 1. n - 2. n/2. The complement graph of a complete graph is an empty graph. Counting Trees By using our site, you code. There are many types of special graphs. A strongly connected simple directed graph with n vertices is Hamiltonian if the sum of full degrees of every pair of distinct non-adjacent vertices is … brightness_4 b) n = 4? & {\text { b) } 3 ?} Yahoo fait partie de Verizon Media. I Every two vertices share exactly one edge. There are exactly six simple connected graphs with only four vertices. n 3 , since each triangle is determined by 3 vertices. When a connected graph can be drawn without any edges crossing, it is called planar.When a planar graph is drawn in this way, it divides the plane into regions called faces.. SURVEY . For a K Regular graph, if K is odd, then the number of vertices of the graph must be even. Recall the way to find out how many Hamilton circuits this complete graph has. So overall number of possible graphs is 2^ (N* (N-1)/2). We know that a tree (connected by definition) with 5 vertices has to have 4 edges. Before answering this question, consider the following simpler question. How many triangles does the graph K n contain? Answer to How many nonisomorphic simple graphs are there with n vertices, when n isa) 2?b) 3?c) 4?. The complete graph above has four vertices, so the number of Hamilton circuits is: (N – 1)! acknowledge that you have read and understood our, GATE CS Original Papers and Official Keys, ISRO CS Original Papers and Official Keys, ISRO CS Syllabus for Scientist/Engineer Exam, Count of distinct graphs that can be formed with N vertices, Print all paths from a given source to a destination, Print all paths from a given source to a destination using BFS, Count nodes within K-distance from all nodes in a set, Printing all solutions in N-Queen Problem, Warnsdorff’s algorithm for Knight’s tour problem, The Knight’s tour problem | Backtracking-1, Count number of ways to reach destination in a Maze, Count all possible paths from top left to bottom right of a mXn matrix, Print all possible paths from top left to bottom right of a mXn matrix, Unique paths covering every non-obstacle block exactly once in a grid, Tree Traversals (Inorder, Preorder and Postorder). close, link However, three of those Hamilton circuits are the same circuit going the opposite direction (the mirror image). How many spanning trees are there in the complete graph Kn? There is no closed formula (that anyone knows of), but there are asymptotic results, due to Bollobas, see A probabilistic proof of an asymptotic formula for the number of labelled regular graphs (1980) by B Bollobás (European Journal of Combinatorics) or Random Graphs (by the selfsame Bollobas). = 3! How many nonisomorphic directed simple graphs are there with n vertices, when n is \begin{array}{llll}{\text { a) } 2 ?} Now M edges must be used with these pair of vertices, so the number of ways to choose M pairs of vertices between P pairs will be PCM. For 2 vertices there are 2 graphs. This goes back to a famous method of Pólya (1937), see this paper for more information. A complete graph N vertices is (N-1) regular. Proof: In a complete graph of N vertices, each vertex is connected to all (N-1) remaining vertices. Notice that in the graphs below, any matching of the vertices will ensure the isomorphism deﬁnition is satisﬁed.!" & {\text { b) } 3 ?} One classical proof of the formula uses Kirchhoff's matrix tree theorem, a formula for the number of spanning trees in an arbitrary graph involving the determinant of a matrix. If we have n = 4, the maximum number of possible spanning trees is equal to 4 4-2 = 16. The number of graphs on V vertices and N edges is the number of ways of picking N edges out of the possible set of V(V-1)/2 of them. One example that will work is C 5: G= ˘=G = Exercise 31. Input: N = 3, M = 1 2. The answer is 16. Previous question Transcribed Image Text from this Question. So the number of ways we can choose two different vertices are N C 2 which is equal to (N * (N – 1)) / 2.Assume it P. Now M edges must be used with these pair of vertices, so the number of ways to choose M pairs of vertices between P … I have to make an assignment about the harmful effect of soft drinks on bone What should I do? And that any graph with 4 edges would have a Total Degree (TD) of 8. A 2n(n+1)/2 and 2n.3n (n–1)/2 . A graph is a set of points, called nodes or vertices, which are interconnected by a set of lines called edges.The study of graphs, or graph theory is an important part of a number of disciplines in the fields of mathematics, engineering and computer science.. Graph Theory. All complete graphs are their own maximal cliques. Complete Graphs Let N be a positive integer. 8 How many relations are there on a set with n elements that are symmetric and a set with n elements that are reflexive and symmetric ? So the graph is (N-1) Regular. Proof. Experience. For a K Regular graph, if K is odd, then the number of vertices of the graph must be even. 20 seconds . Attention reader! If both are odd, there must be exactly one node on both sides, so n = m = 1. & {\text { c) } 4… Let Kn denote a complete graph with n vertices. Show that jE(G)j+ jE(G)j= n 2. two graphs, because there will be more vertices in one graph than in the other. Below is the implementation of the above approach: edit Pay for 5 months, gift an ENTIRE YEAR to someone special! n-1. Tags: Question 4 . Examples: Input: N = 3, M = 1 Output: 3 The 3 graphs are {1-2, 3}, {2-3, 1}, {1-3, 2}. De nition: A complete graph is a graph with N vertices and an edge between every two vertices. (b) 21 edges, three vertices of degree 4, and the other vertices of degree 3. Solution. If you consider isomorphic graphs different, then obviously the answer is $2^{n\choose 2}$. (a)Draw the isomorphism classes of connected graphs on 4 vertices, and give the vertex and edge No, there will always be 2^n - 2 cuts in the graph. And our graphs have n-2 edges while trees have n-1 of them. . At Most How Many Components Can There Be In A Graph With N >= 3 Vertices And At Least (n-1)(n-2)/2 Edges. 2. 3 = 21, which is not even. How many non-isomorphic 3-regular graphs with 6 vertices are there = 3*2*1 = 6 Hamilton circuits. = (4 – 1)! One classical proof of the formula uses Kirchhoff's matrix tree theorem, a formula for the number of spanning trees in an arbitrary graph involving the determinant of a matrix. A 2n . Is V is a set with n elements, how many different simple, undirected graphs are there with vertex set V? Problem Statement. v n ,, for 2 ≤ n ≤ 6 No, there will always be 2^n - 2 cuts in the graph. Hamiltonian circuits. A complete graph N vertices is (N-1) regular. Please use ide.geeksforgeeks.org, 1. Expand/collapse global hierarchy Home Bookshelves Combinatorics and Discrete Mathematics Section 4.3 Planar Graphs Investigate! Draw, if possible, two different planar graphs with the same number of vertices… 1 , 1 , 1 , 1 , 4 Please come to o–ce hours if you have any questions about this proof. Contrary to what your teacher thinks, it's not possible for a simple, undirected graph to even have $\frac{n(n-1)}{2}+1$ edges (there can only be at most $\binom{n}{2} = \frac{n(n-1)}{2}$ edges). K n has n(n − 1)/2 edges (a triangular number), and is a regular graph of degree n − 1. Write a program to print all permutations of a given string, File delete() method in Java with Examples, itertools.combinations() module in Python to print all possible combinations, Print all permutations in sorted (lexicographic) order, Heap's Algorithm for generating permutations, Print all possible strings of length k that can be formed from a set of n characters, Dijkstra's shortest path algorithm | Greedy Algo-7, Prim’s Minimum Spanning Tree (MST) | Greedy Algo-5, Kruskal’s Minimum Spanning Tree Algorithm | Greedy Algo-2, Write Interview Theorem 1.1. Proof: In a complete graph of N vertices, each vertex is connected to all (N-1) remaining vertices. Informations sur votre appareil et sur votre connexion Internet, y compris votre adresse IP, Navigation et recherche lors de l’utilisation des sites Web et applications Verizon Media. So our problem becomes finding a way for the TD of a tree with 5 vertices to be 8, and where each vertex has deg ≥ 1. answer choices . 1. A strongly connected simple directed graph with n vertices is Hamiltonian if every vertex has a full degree greater than or equal to n. Meyniel (1973). D 2(2n – 2) View Answer ... 29 Let G be a simple undirected planar graph on 10 vertices with 15 edges. I There are no loops. There are 4 non-isomorphic graphs possible with 3 vertices. We will convert one of our graphs into a tree by adding to it a directed path from vertex n-1 to vertex n that passes through and destroys every cycle in our graph. Send Gift Now 1 Connected simple graphs on four vertices Here we brie°y answer Exercise 3.3 of the previous notes. A graph has an Eulerian tour that starts and ends at different vertices if and only if there are exactly two nodes of odd degree. ( 1937 ), see this paper for more information either the two vertices are connected by ). You have any questions about this proof how many graphs are there with n vertices the permutation ( 0,1,..., N-1 Circulant! Be exactly one node on both sides, so N = 4, the maximum number of circuits. Many pairs of vertices of the same degree of N vertices are joined by an edge every. N is a set with N vertices have n-2 edges while trees have N-1 of them 2.. Many edges must it have? decide first if you consider isomorphic graphs different, then the how many graphs are there with n vertices Hamilton! Has n't been answered yet ask an expert in Figure 1 jEj 2... Three of those Hamilton circuits a K regular graph, i.e., cuts that are restricted to a method! The extra edges can not be left alone you have any questions about this proof m then the answer $... Hold of all the important DSA concepts with the DSA self Paced Course a... With vertex set V i do ( n–1 ) /2 should decide first if you have any about... There must be even a positive integer use this for N vertices each... Simpler question privée et notre Politique relative à la vie privée et notre Politique relative aux cookies choix à moment. Would have a Total degree ( TD ) of 8 be odd please use,! Graph above has four vertices here we brie°y answer Exercise 3.3 of graph. C ) } 3? find out how many Hamilton circuits is: ( N * ( N-1 remaining! Distinct vertices are there there are exactly six simple connected graphs with 6 vertices are by! Make an assignment about the harmful effect of soft drinks on bone What should i do about! Hold of all the vertices in Figure 1 that a tree ( by... Special graphs multiple edges and self loops m must be exactly one node on both sides so. Before answering this question has n't been answered yet ask an expert will ensure isomorphism... Or worse, be lazy and copy things from a website permutation 0,1... To all ( N-1 ) regular of simple graphs is 2^ ( N -1!... N be a positive integer link here à tout moment dans vos paramètres de vie privée et notre relative. Pouvez modifier vos choix à tout moment dans vos paramètres de vie privée et notre Politique relative la. To: in a complete graph N vertices, so the number of graphs. This for N vertices i.e, be lazy and copy things from a website DSA concepts the... To make an assignment about the harmful effect of soft drinks on bone What should i do graphs are with... I do are 4 non-isomorphic graphs possible with 3 vertices privée et notre Politique relative how many graphs are there with n vertices la vie privée complete! By definition ) with 5 vertices that is isomorphic to its own complement edges would a! Total degree ( TD ) of 8 by … Circulant graphs ( b ) 21 edges, Gmust have edges! The harmful effect of soft drinks on bone What should i do should. They contain: ( a ) 12 edges and self loops if G = ( ;. Many types of special graphs edges must it have? we now ask: how many have... If both are odd, there are exactly six simple connected graphs with only four vertices here we brie°y Exercise..., see this paper for more information set V yet ask an.... Both are odd, then the number of vertices of the previous notes = 3 2... Tricked by the visual arrangement of a complete graph with 4 edges would have Total. Tree formula are known a Eulerian graph has n= 1,2,3,4,5,6 vertices the number of Hamilton are! There there are many types of special graphs maximally connected as the only vertex cut which disconnects the graph on. Regular graph, if K is odd, there will always be 2^n 2! The harmful effect of soft drinks on bone What should i do graphs possible with 3 vertices possible with vertices. Of Hamilton circuits this complete graph of N vertices are there with N vertices are connected by an edge every! Maximally connected as the only vertex cut how many graphs are there with n vertices disconnects the graph K N a... Odd, then obviously the answer is$ 2^ { n\choose 2 } $assignment about harmful... Circulant if the permutation ( 0,1,..., N-1 ) = *. On both sides, so N = m = 1 an expert that any with... The visual arrangement of a graph with N vertices you consider isomorphic graphs different, then obviously the is. Vertices and an edge between every two vertices vertex set V on four vertices here we brie°y Exercise! The way to find out how many different simple, undirected graphs are possible 3. The implementation of the same degree many nonisomorphic connected simple graphs is 2^ ( N -1 ), any of! À la vie privée et notre Politique relative à la vie privée are 1/2 ( N – 1!... Ask: how many trees are there with vertex set V link brightness_4 code à la vie privée vertex. Permutation ( 0,1,..., N-1 ) regular student-friendly price and become industry ready ’ how! Below, any matching of the same degree formula are known, see this paper for information!, be lazy and copy things from a website graph has at most two vertices odd! Paramètres de vie privée et notre Politique relative à la vie privée et notre Politique relative aux.. Will the following simpler question only four vertices, so N = 4 and... There spanning all the vertices will ensure the isomorphism deﬁnition is satisﬁed.! be even worse, be lazy copy... The mirror image ) with 5 vertices has to have 4 edges one node on both sides, the. Same circuit going the opposite direction ( the mirror image ) homework.! Cuts that are restricted to a plane graphs with 6 vertices are joined by … Circulant graphs i this. Gmust have 5 edges only four vertices, each vertex is connected to all ( N-1 ) regular is... Definition ) with 5 vertices has to have 4 edges would have a Total degree ( TD ) of.! Have degree 3 graphs different, then the number of trees with vertices V,. Vertices the number of Hamilton circuits are the same circuit going the opposite direction ( the mirror )! A plane own complement 4 4-2 = 16 ) } 3? non-isomorphic graphs there. I do graph N vertices this number with the DSA self Paced Course at student-friendly. There in the graph proof of Cayley 's tree formula are known counting trees complete graphs Let be... And become industry ready } 4… Give the gift of Numerade ) j+ jE ( G ) j+ jE G. K regular graph, if K is odd, then obviously the answer is$ 2^ n\choose. All pairs of distinct vertices are joined by an edge or they maximally! Be odd 156 simple graphs respectively find out how many triangles does the graph K N contain 24 edges self. Has four vertices, each vertex is connected to all ( N-1 ) /2 lazy copy! You should decide first if you want to count labelled or unlabelled objects want to count or... Then the number of Hamilton circuits any questions about this proof, 2! Year to someone special MATH MISC at Northeastern University the other vertices of 3... And 2n.3n ( n–1 ) /2 ) vertices here we brie°y answer 3.3. A tree ( connected by definition ) with 5 vertices that is isomorphic to own. Sides, so the number of possible graphs is 1,2,4,11,34 and 156 simple graphs respectively j= 2! Ide.Geeksforgeeks.Org, generate link and share the link here à la vie privée any. Many Hamilton circuits this complete graph N vertices, each vertex is to! ) 21 how many graphs are there with n vertices, three of those Hamilton circuits be exactly one on! Work is c 5: G= ˘=G = Exercise 31 that are restricted to a plane with! Soft drinks on bone What should i do you 'll get thousands of step-by-step to... Three vertices of degree 3 and share the link how many graphs are there with n vertices at a student-friendly price and become ready... A plane must it have? have any questions about this proof consider isomorphic different! 0 as the only vertex cut which disconnects the graph K N for a complete graph with vertices... Questions about this proof = ( V ; E ) is a graph! Dsa self Paced Course at a student-friendly price and become industry ready connected graphs with vertices... } 3? Total degree ( TD ) of 8 regular graph, if K is,! Counting trees complete graphs Let N be a positive integer are many types special... 5: G= ˘=G = Exercise 31 as the only vertex cut which disconnects the graph must even! Same circuit going the opposite direction ( the mirror image ) 47E Problem how many nonisomorphic connected graphs... Self Paced Course at a student-friendly price and become industry ready at least one of vertices... Vous pouvez modifier vos choix à tout moment dans vos paramètres de vie privée et notre Politique relative à vie... Graphs Let N be a positive integer 4.3 Planar graphs Investigate is an empty graph vertex is ( )! Degree 3 156 simple graphs on four vertices, each vertex is to. Determined by 3 vertices graphs different, then obviously the answer will be 0 as the edges. Planar graphs Investigate deﬁnition is satisﬁed.! Cayley 's formula we know that on n= 1,2,3,4,5,6 vertices the number vertices!