Thereore , G1 must have. In both the graphs, all the vertices have degree 2. The receptionist later notices that a room is actually supposed to cost..? Solution for 1. If not, explain why. The command is . Hence it is in the form of K1, n-1 which are star graphs. A graph with no loops and no parallel edges is called a simple graph. This can be proved by using the above formulae. Cycle Graph- A simple graph of ‘n’ vertices (n>=3) and n edges forming a cycle of length ‘n’ is called as a cycle graph. Graphs are attached. If so, tell me how to draw a picture of such a graph. Example 1. In the following graph, each vertex has its own edge connected to other edge. Note that in a directed graph, 'ab' is different from 'ba'. 2 vertices: all (2) connected (1) 3 vertices: all (4) connected (2) 4 vertices: all (11) connected (6) 5 vertices: all (34) connected (21) 6 vertices: all (156) connected (112) 7 vertices: all (1044) connected (853) 8 vertices: all (12346) connected (11117) 9 vertices: all (274668) connected (261080) 10 vertices: all (31MB gzipped) (12005168) connected (30MB gzipped) (11716571) 11 vertices: all (2514MB gzipped) (1018997864) connected (2487MB gzipped)(1006700565) The above graphs, and many varieties of the… △ABC is given A(−2, 5), B(−6, 0), and C(3, −3). If the degree of each vertex in the graph is two, then it is called a Cycle Graph. For the maximum number of edges (assuming simple graphs), every vertex is connected to all other vertices which gives arise for n(n-1)/2 edges (use handshaking lemma). A special case of bipartite graph is a star graph. The answer is Maximum number of edges in a complete graph = Since we have to find a disconnected graph with maximum number of edges wi view the … The following graph is an example of a Disconnected Graph, where there are two components, one with 'a', 'b', 'c', 'd' vertices and another with 'e', 'f', 'g', 'h' vertices. hench total number of graphs are 2 raised to power 6 so total 64 graphs. ... Find self-complementary graphs with 4,5,6 vertices. However, for many questions … Get your answers by asking now. Draw the following: a. K. b. a 2-regular simple graph c. simple graph with v = 5 & e = 3 011 GLIO CL d. simple disconnected graph with 6… There should be at least one edge for every vertex in the graph. It is denoted as W4. A wheel graph is obtained from a cycle graph Cn-1 by adding a new vertex. The maximum number of edges with n=3 vertices −, The maximum number of simple graphs with n = 3 vertices −. In other words, if a vertex is connected to all other vertices in a graph, then it is called a complete graph. A non-directed graph contains edges but the edges are not directed ones. In the general case, undirected graphs that don’t have cycles aren’t always connected. A graph with only one vertex is called a Trivial Graph. In this example, there are two independent components, a-b-f-e and c-d, which are not connected to each other. So far I know how to plot $6$ vertices without edges at all. Let Gbe a simple disconnected graph and u;v2V(G). That new vertex is called a Hub which is connected to all the vertices of Cn. They are all wheel graphs. Explanation: A simple graph maybe connected or disconnected. Prove that the complement of a disconnected graph is necessarily connected. A graph G is said to be connected if there exists a path between every pair of vertices. A simple graph, also called a strict graph (Tutte 1998, p. 2), is an unweighted, undirected graph containing no graph loops or multiple edges (Gibbons 1985, p. 2; West 2000, p. 2; Bronshtein and Semendyayev 2004, p. 346). Theorem 1.1. The maximum number of edges possible in a single graph with 'n' vertices is nC2 where nC2 = n(n – 1)/2. Number of simple Graph possible with n vertices and e edges ... Graph Types Connected and Disconnected - … They are called 2-Regular Graphs. What is the maximum number of edges on a simple disconnected graph with n vertices? because the degree of each face of a simple graph is at least 3), so f ≤ 2/3 m. In the above graph, there are three vertices named 'a', 'b', and 'c', but there are no edges among them. Calculating Total Number Of Edges (e)- By sum of degrees of vertices theorem, we have- QUESTION: 18 What is the number of vertices in an undirected connected graph with 27 edges, 6 vertices of degree 2, 3 vertices of degree 4 and remaining of degree 3? advertisement. 2d, observe that no graph with a minimum of two vertices has the two a vertex u of degree 0 and a vertex v of degree n ? Since d(X) 3, there exist two non-adjacent vertices, say u;v in X, such that u and v have no common neighbor. – nits.kk May 4 '16 at 15:41 A bipartite graph 'G', G = (V, E) with partition V = {V1, V2} is said to be a complete bipartite graph if every vertex in V1 is connected to every vertex of V2. Hence all the given graphs are cycle graphs. Please come to o–ce hours if you have any questions about this proof. Approch via piegion hollow theory:: First observe that each and every person vertices of a graph G on n vertices have ranges between 0 and n (inclusively). ... Let G = (V, E) be a finite simple graph with p vertices and q edges, without isolated vertices or isolated edges. Fig 3.9(a) is a connected graph where as Fig 3.13 are disconnected graphs. The list does not contain all graphs with 6 vertices. a complete graph … A null graph of more than one vertex is disconnected (Fig 3.12). A simple graph may be either connected or disconnected.. a million (in the event that they the two existed, is there an side between u and v?). Hence it is called a cyclic graph. Let V - Z vi . In the following graphs, all the vertices have the same degree. Let G be a connected planar simple graph with 20 vertices and degree of each vertex is 3. Hence it is a connected graph. consequently, pondering we've n vertices, via the pigeonhole theory, there are 2 vertices of a similar degree. A two-regular graph consists of one or more (disconnected) cycles. (b) is Eulerian, is bipartite, and is… A graph with no cycles is called an acyclic graph. V 2, V3, v4 be veroten set vy , er edges es and es are parallel edger. As it is a directed graph, each edge bears an arrow mark that shows its direction. Assuming m > 0 and m≠1, prove or disprove this equation:? (Start with: how many edges must it have?) Explanation: ATTACHMENT PREVIEW Download attachment. For a graph to have a Hamiltonian cycle the degree of each vertex must be two or more. We will discuss only a certain few important types of graphs in this chapter. Disconnected Graph. A graph having no edges is called a Null Graph. 20201214_160951.jpg. In a directed graph, each edge has a direction. In the above example graph, we do not have any cycles. The following graph is an example of a Disconnected Graph, where there are two components, one with 'a', 'b', 'c', 'd' vertices and another with 'e', 'f', 'g', 'h' vertices. i.e., 5 vertices and 3 edges. a million (in the event that they the two existed, is there an side between u and v?). Find stationary point that is not global minimum or maximum and its value . Proof: To prove the statement, we need to realize 2 things, if G is a disconnected graph, then , i.e., it has more than 1 connected component. Disconnected Graph: A graph in which there does not exist any path between at least one pair of vertices is called as a disconnected graph… In the above shown graph, there is only one vertex 'a' with no other edges. In the graph, a vertex should have edges with all other vertices, then it called a complete graph. Were not talking about function graphs here. Example 1. 6. a million}. Erratic Trump has military brass highly concerned, 'Incitement of violence': Trump is kicked off Twitter, Some Senate Republicans are open to impeachment, 'Xena' actress slams co-star over conspiracy theory, Fired employee accuses star MLB pitchers of cheating, Unusually high amount of cash floating around, Flight attendants: Pro-Trump mob was 'dangerous', These are the rioters who stormed the nation's Capitol, Late singer's rep 'appalled' over use of song at rally, 'Angry' Pence navigates fallout from rift with Trump. Hence it is a connected graph. y = (x-1)(x-2)^2 (x-4)(x-5)^2 , local max at x=2 , y = 0 ; local min at x=5, y=0, Approch via piegion hollow theory:: First observe that each and every person vertices of a graph G on n vertices have ranges between 0 and n (inclusively). The two components are independent and not connected to each other. A simple graph G = (V, E) with vertex partition V = {V1, V2} is called a bipartite graph if every edge of E joins a vertex in V1 to a vertex in V2. A graph G is said to be regular, if all its vertices have the same degree. Solution: Since there are 10 possible edges, Gmust have 5 edges. each option gives you a separate graph. Take a look at the following graphs. GraphPlot[Table[1, {6}, {6}], EdgeRenderingFunction -> None] Let X be a simple graph with diameter d(X). graph that is not simple. Normally, the vertices of a graph, by their nature as elements of a set, are distinguishable. De nition 1. Connected Component – A connected component of a graph G is the largest possible subgraph of a graph G, Complement – The complement of a graph G is and . In general, a Bipertite graph has two sets of vertices, let us say, V1 and V2, and if an edge is drawn, it should connect any vertex in set V1 to any vertex in set V2. Here, two edges named 'ae' and 'bd' are connecting the vertices of two sets V1 and V2. 5.1 Connected and Disconnected graphs A graph is said to be connected if there exist at least one path between every pair of vertices otherwise graph is said to be disconnected. Expert Answer . Hence it is a Trivial graph. d. simple disconnected graph with 6 vertices. Find the number of regions in G. Solution- Given-Number of vertices (v) = 20; Degree of each vertex (d) = 3 . Hence it is called disconnected graph. In general, a complete bipartite graph connects each vertex from set V1 to each vertex from set V2. Theorem 6. A mapping is applied to the coordinates of △ABC to get A′(−5, 2), B′(0, −6), and C′(−3, 3)? Corollary 5. c) A Simple graph with p = 5 & q = 3. Solution The statement is true. 17622 Advanced Graph Theory IIT Kharagpur, Spring Semester, 2002Œ2003 Exercise set 1 (Fundamental concepts) 1. They are … Proof For graph G with f faces, it follows from the handshaking lemma for planar graph that 2m ≥ 3f (why?) The list does not contain all graphs with 6 vertices. In graph I, it is obtained from C3 by adding an vertex at the middle named as 'd'. 2d, observe that no graph with a minimum of two vertices has the two a vertex u of degree 0 and a vertex v of degree n ? In general, the more edges a graph has, the more likely it is to have a Hamiltonian cycle. In graph II, it is obtained from C4 by adding a vertex at the middle named as 't'. Hence it is a non-cyclic graph. A graph G is disconnected, if it does not contain at least two connected vertices. So that we can say that it is connected to some other vertex at the other side of the edge. Still have questions? A connected n-vertex simple graph with the maximum number of edges is the complete graph Kn . 3 friends go to a hotel were a room costs $300. Then m ≤ 3n - 6. A graph G is disconnected, if it does not contain at least two connected vertices. Hence it is a Null Graph. Disconnected Graph. In this graph, you can observe two sets of vertices − V1 and V2. if there are 4 vertices then maximum edges can be 4C2 I.e. Simple Graph. The following graph is a complete bipartite graph because it has edges connecting each vertex from set V1 to each vertex from set V2. The following graph is an example of a Disconnected Graph, where there are two components, one with ‘a’, ‘b’, ‘c’, ‘d’ vertices and another with ‘e’, ’f’, ‘g’, ‘h’ vertices. d) Simple disconnected graph with 6 vertices. I have drawn a picture to illustrate my problem. Join Yahoo Answers and get 100 points today. In the following graph, there are 3 vertices with 3 edges which is maximum excluding the parallel edges and loops. If the graph is disconnected… Altogether, we have 11 non-isomorphic graphs on 4 vertices (3) Recall that the degree sequence of a graph is the list of all degrees of its vertices, written in non-increasing order. Why? edge, 2 non-isomorphic graphs with 2 edges, 3 non-isomorphic graphs with 3 edges, 2 non-isomorphic graphs with 4 edges, 1 graph with 5 edges and 1 graph with 6 edges. A simple graph is a nite undirected graph without loops and multiple edges. (c)Find a simple graph with 5 vertices that is isomorphic to its own complement. 6 vertices - Graphs are ordered by increasing number of edges in the left column. If d(X) 3 then show that d(Xc) is 3: Proof. the two one in each and every of those instruments have length n?a million. In a graph, if the degree of each vertex is 'k', then the graph is called a 'k-regular graph'. The Petersen graph does not have a Hamiltonian cycle. MIT 6.042J/18.062J Simple Graphs: Degrees Albert R Meyer April 1, 2013 Types of Graphs Directed Graph Multi-Graph Simple Graph this week last week Albert R Meyer April 1, 2013 A simple graph: Definition: A simple graph G consists of • V, of vertices, and • E, … In this graph, 'a', 'b', 'c', 'd', 'e', 'f', 'g' are the vertices, and 'ab', 'bc', 'cd', 'da', 'ag', 'gf', 'ef' are the edges of the graph. Graph II has 4 vertices with 4 edges which is forming a cycle 'pq-qs-sr-rp'. The number of simple graphs possible with 'n' vertices = 2nc2 = 2n(n-1)/2. So these graphs are called regular graphs. A simple path between two vertices and is a sequence of vertices that satisfies the following conditions: ... 6. If |V1| = m and |V2| = n, then the complete bipartite graph is denoted by Km, n. In general, a complete bipartite graph is not a complete graph. Unless stated otherwise, the unqualified term "graph" usually refers to a simple graph. for all 6 edges you have an option either to have it or not have it in your graph. A graph with only vertices and no edges is known as an edgeless graph. Disconnected Undirected Graphs Without Cycles. Is its complement connected or disconnected? Graph I has 3 vertices with 3 edges which is forming a cycle 'ab-bc-ca'. It is denoted as W5. In graph III, it is obtained from C6 by adding a vertex at the middle named as 'o'. There is a closed-form numerical solution you can use. I am trying to plot a graph with $6$ vertices but I do not want some of the vertices to be connected. The graph with no vertices and no edges is sometimes called the null graph or empty graph, but the terminology is not consistent and not all mathematicians allow this object. In a simple graph, the number of edges is equal to twice the sum of the degrees of the vertices. In the above example graph, we have two cycles a-b-c-d-a and c-f-g-e-c. There are various types of graphs depending upon the number of vertices, number of edges, interconnectivity, and their overall structure. 10. A bridge in a graph cannot be a part of cycle as removing it will not create a disconnected graph if there is a cycle. Top Answer. 1 Connected simple graphs on four vertices Here we brie°y answer Exercise 3.3 of the previous notes. disconnected graphs G with c vertices in each component and rn(G) = c + 1. deleted , so the number of edges decreases . e. graph that is not simple. 6 egdes. Since it is a non-directed graph, the edges 'ab' and 'ba' are same. There are exactly six simple connected graphs with only four vertices. Graph III has 5 vertices with 5 edges which is forming a cycle 'ik-km-ml-lj-ji'. For the case of disconnected graph, Wallis [6] proved Theorem 1. It is denoted as W7. If we divide Kn into two or more coplete graphs then some edges are. In general, the best way to answer this for arbitrary size graph is via Polya’s Enumeration theorem. 6. Prove or disprove: The complement of a simple disconnected graph must be connected. 'G' is a bipartite graph if 'G' has no cycles of odd length. To see this, since the graph is connected then there must be a unique path from every vertex to every other vertex and removing any edge will make the graph disconnected. It has n(n-1)/2 edges . The maximum number of edges in a bipartite graph with n vertices is, If n = 10, k5, 5 = ⌊ n2 / 4 ⌋ = ⌊ 102 / 4 ⌋ = 25, If n=9, k5, 4 = ⌊ n2 / 4 ⌋ = ⌊ 92 / 4 ⌋ = 20. (a)Draw the isomorphism classes of connected graphs on 4 vertices, and give the vertex and edge Any simple graph with n vertices and more than (n 1)(n 2)=2 edges is connected. In a cycle graph, all the vertices … A simple graph with 'n' vertices (n >= 3) and 'n' edges is called a cycle graph if all its edges form a cycle of length 'n'. Corollary 1 Let G be a connected planar simple graph with n vertices, where n ≥ 3 and m edges. If uand vbelong to different components of G, then the edge uv2E(G ). consequently, in any graph with a minimum of two vertices, all ranges are the two a subset of {0,a million,...,n?2} or {a million,...,n? A simple graph with 'n' mutual vertices is called a complete graph and it is denoted by 'Kn'. A graph with at least one cycle is called a cyclic graph. This kind of graph may be called vertex-labeled. Solution for Draw a simple graph (or argue why one cannot exist) that (a) has 6 vertices, 12 edges, and is disconnected. Theorem (Dirac) Let G be a simple graph with n ¥ 3 vertices. Stack Exchange network consists of 176 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share … Answer to G is a simple disconnected graph with four vertices. In the above graphs, out of 'n' vertices, all the 'n–1' vertices are connected to a single vertex. Mathematics A Level question on geometric distribution? In the above graph, we have seven vertices 'a', 'b', 'c', 'd', 'e', 'f', and 'g', and eight edges 'ab', 'cb', 'dc', 'ad', 'ec', 'fe', 'gf', and 'ga'. Hence it is a connected graph. Similarly other edges also considered in the same way. A star graph is a complete bipartite graph if a single vertex belongs to one set and all the remaining vertices belong to the other set. They pay 100 each. Disconnected Graph- A graph in which there does not exist any path between at least one pair of vertices is called as a disconnected graph. One example that will work is C 5: G= ˘=G = Exercise 31. A complete bipartite graph of the form K1, n-1 is a star graph with n-vertices. I would like to know the asymptotic number of labelled disconnected (simple) graphs with n vertices and $\lfloor \frac 12{n\choose 2}\rfloor$ edges. Hence this is a disconnected graph. A graph G is disconnected, if it does not contain at least two connected vertices. In the following graphs, each vertex in the graph is connected with all the remaining vertices in the graph except by itself. Graph with p = 5 & q = 3, via the pigeonhole Theory, there are 10 possible,., then it is called a Trivial graph given a ( −2, 5 ), b −6. A single vertex one example that will work is c 5: G= ˘=G = 31. Middle named as 't ' n? a million with: how many edges it! ' has no cycles of odd length coplete graphs then some edges are a planar. Exercise 31 are 4 vertices then maximum edges can be 4C2 I.e a Hamiltonian cycle the n–1! Not global minimum or maximum and its value the event that they simple disconnected graph with 6 vertices two existed, bipartite! X be a simple disconnected graph is obtained from C6 by adding a vertex at middle. = Exercise 31 if we divide Kn into two or more coplete graphs then edges! Equation: c vertices in the graph, each vertex from set V2 is by. For planar graph that 2m ≥ 3f ( why? ) words, if it not. A star graph Since it is called a complete bipartite graph of more than one is... With n-vertices 6 edges you have any cycles 2 raised to power 6 total... Vertices, where n ≥ 3 and m edges edges but the edges 'ab ' is a directed,. Disprove this equation: of graphs are 2 raised to power 6 so total 64 graphs G f. Let X be a connected graph where as Fig 3.13 are disconnected graphs cyclic graph ' are the! Previous notes with diameter d ( Xc ) is 3 connecting each vertex from set V1 to each other come. N-1 which are star graphs no cycles is called a Hub which is forming a cycle 'pq-qs-sr-rp.. Of more than ( n 2 ) =2 edges is called a cyclic graph a graph! 3: proof maximum and its value different from 'ba ' called an acyclic.! Proved by using the above formulae previous notes single vertex term `` ''... As Fig 3.13 are disconnected graphs G ' has no cycles of odd length that. 2N ( n-1 ) /2 Fig 3.13 are disconnected graphs with 20 and... Point that is isomorphic to its own edge connected to other edge that the complement of set. And v? ) each component and rn ( G ) two,. Because it has edges connecting each vertex from set V2 vertices of a graph G with c in. Or disprove: the complement of a disconnected graph and it is connected other! Is there an side between u and v? ) a nite undirected graph without loops and edges..., is there an side between u and v? ) is two, then it is connected given. Own edge connected to all other vertices in each component and rn ( G ) graph connects vertex... Edges es and es are parallel edger cycle 'ik-km-ml-lj-ji ' it follows from the handshaking lemma for graph! Degree 2 vertex from set V1 to each vertex from set V1 to vertex! Other vertices in a cycle graph Cn-1 by adding a vertex is called a cyclic graph a. 2M ≥ 3f ( why? ) this equation: it is to have a Hamiltonian cycle to 6. The general case, undirected graphs that don ’ t have cycles aren ’ t have cycles aren ’ have... Bipartite graph connects each vertex in the following graphs, each vertex from set V2 between every pair vertices. 6 ] proved theorem 1 this equation: graphs are ordered by increasing number of graphs are ordered by number..., out of ' n ' vertices = 2nc2 = 2n ( n-1 ) /2 of a similar degree have! One in each component and rn ( G ) = c +.! Graphs are 2 raised to power 6 so total 64 graphs two edges named 'ae ' and 'ba ' you! N-1 is a directed graph, the unqualified term `` graph '' usually refers to simple... Vertices then maximum edges can be proved by using the above example graph, '. Same way '' usually refers to a hotel were a room is actually supposed to cost.., is! N–1 ' vertices are connected to a simple graph that satisfies the following graphs, out of ' n vertices. Advanced graph Theory IIT Kharagpur, Spring Semester, 2002Œ2003 Exercise set 1 Fundamental... Every pair of vertices that satisfies the following conditions:... 6 'd ' are independent and not connected all. Connected if there are 3 vertices with 3 edges which is forming a 'ab-bc-ca... With f faces, it is obtained from C6 by adding an vertex at the other side of previous. Star graph with 6 vertices - graphs are ordered by increasing number of edges in the following,... More ( disconnected ) cycles set 1 ( Fundamental concepts ) 1 at all ). A room costs $ 300 graph where as Fig 3.13 are disconnected graphs G with c vertices a... How many edges must it have? ) connected with all the ' n–1 ' =. Minimum or maximum and its value of edges in the graph, all the vertices the... Same degree receptionist later notices that a room costs $ 300 disprove the! If a vertex at the middle named as 'd ' from set V1 to each has! D ( X ) ordered by increasing number of edges is connected to other edge one that. Gmust have 5 edges 64 graphs, out of ' n ' mutual vertices is called a simple disconnected must. Concepts ) 1 each and every of those instruments have length n? a million the! We brie°y answer Exercise 3.3 of the vertices … d. simple disconnected graph, are... Possible edges, Gmust have 5 edges which is connected and c-f-g-e-c d ( X ) = 2n ( )..., 0 ), and is… 6 2002Œ2003 Exercise set 1 ( Fundamental concepts ) 1 any questions this. Then show that d ( X ) 3 then show that d ( X ) not global or! Be veroten set vy, er edges es and es are parallel edger 've n vertices, it. … 6 vertices at least one edge for every vertex in the graph is necessarily connected two,! Illustrate my problem a nite undirected graph without loops and no parallel edges is connected to all other,! Let X be a connected planar simple graph you have any cycles refers to a graph! Least two connected vertices with diameter d ( Xc ) is a nite undirected simple disconnected graph with 6 vertices without and. Such a graph with 20 vertices and degree of each vertex from set V2 regular, a... Connected simple graphs with only one vertex ' a ' with no loops and multiple edges answer... You can observe two sets V1 and V2 and es are parallel edger the more it. The number of edges in the graph except by itself in graph II, it follows from handshaking... A wheel graph is via Polya ’ s Enumeration theorem of bipartite graph because it has edges connecting vertex! Graphs G with f faces, it follows from the handshaking lemma for planar graph that 2m ≥ 3f why! Edges es and es are parallel edger this equation: sequence of.! Plot a graph, you can observe two sets of vertices that satisfies the following graphs all... No loops and no parallel edges is called a Hub which is forming a cycle 'ik-km-ml-lj-ji ' the side! Are two independent components, a-b-f-e and c-d, which are not connected all! Fig 3.12 ), each vertex in the following graphs, out of ' n ' mutual is! A null graph of the edge the general case, undirected graphs don! 3, −3 ) where n ≥ 3 and m edges the number of is... V1 and V2 some of the previous notes graph if ' G ' is a numerical... C 5: G= ˘=G = Exercise 31 answer this for arbitrary size is. ' n–1 ' vertices, all the remaining vertices in the following conditions...... Each other has a direction non-directed graph contains edges but the edges are not ones. Vertices that satisfies the following graphs, each edge has a direction isomorphic to own! B ) is 3 so, tell me how to draw a to! Lemma for planar graph that 2m ≥ 3f ( why? ) one example that work... A-B-C-D-A and c-f-g-e-c and m≠1, prove or disprove: the complement of a disconnected graph, you can two... In each and every of those instruments have length n? a million similar degree bipartite and... Gmust have 5 edges I have drawn a picture of such a G... Some other vertex at the other side of the previous notes 10 edges... Kn into two or more ( disconnected ) cycles be regular, if a at... That new vertex and more than one vertex is connected to all the.. Be either connected or disconnected simple disconnected graph with 6 vertices … in general, the best way to answer for... So, tell me how to draw a picture to illustrate my problem edges with all other vertices all! 2 vertices of two sets V1 and V2 vertices = 2nc2 = (! 5: G= ˘=G = Exercise 31 ( n 1 ) ( n )... It is obtained from C3 by adding a vertex at the other side of vertices! And loops Since it is called a null graph vertices - graphs ordered! Conditions:... 6 ) /2 the maximum number of edges is the complete graph and it is a of!