answersLogoWhite

0


Best Answer

V*(V-1)/2

User Avatar

Wiki User

โˆ™ 11y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: What is the maximum number of edges in an undirected graph with V vertices?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

What is the maximum number of edges in an acyclic undirected graph with n vertices?

n * (n - 1) / 2 That would ignore the "acyclic" part of the question. An acyclic graph with the maximum number of edges is a tree. The correct answer is n-1 edges.


What is the sum of degrees of all vertices in an undirected graph is twice the number of edges?

It is a true statement.


Maximum number of edges in an acyclic undirected graph with n?

n - 1


What is n in Maximum number of edges in an acyclic undirected graph with n?

n-1


What has 6 vertices and 15 edges?

I believe that such an object cannot exist in normal 3-d space. If there are 6 vertices, the maximum number of edges is 12.


Which 2 shapes have the same number of edges and vertices?

no numbers have the same number of edges and vertices


What is the relationship among the vertices's faces and edges of polyhedrons?

If you add the vertices and Faces and subtract 2 from that number you get the number of edges. Vertices+Faces=Edges+2


What is a shape that has equal number of faces equal number edges and equal number of vertices?

A sphere- there are no faces, edges or vertices


What is the number of faces vertices and edges of a rectangular prism and a rectangular pyramid?

for any prism , number of ___ + number of vertices = number of edges + ___


What 3D shape has most vertices and edges?

There is no limit to the number of vertices nor edges.


How many edges vertices and edges does a rectangle2D have?

Edges: 4, Vertices: 4 and Edges: still 4, their number hasn't changed!


What is the maximum number of distinct edges in an undirected graph with N vertices?

Let G be a complete graph with n vertices. Consider the case where n=2. With only 2 vertices it is clear that there will only be one edge. Now add one more vertex to get n = 3. We must now add edges between the two old vertices and the new one for a total of 3 vertices. We see that adding a vertex to a graph with n vertices gives us n more edges. We get the following sequence Edges on a graph with n vertices: 0+1+2+3+4+5+...+n-1. Adding this to itself and dividing by two yields the following formula for the number of edges on a complete graph with n vertices: n(n-1)/2.