Register
What is the maximum number of edges for an undirected graph? A directed graph?
182k views
0 votes
What is the maximum number of edges for an undirected graph? A directed graph?

User Prankul Garg
by
4.5k points

1 Answer

4 votes

Answer:

For undirected graph n(n-1) for directed graph
(n(n-1))/(2)

Step-by-step explanation:

The maximum number of edges for a undirected graph is given by
n(n-1), where n is number of vertices

The maximum number of edges in directed graph is given by
(n(n-1))/(2), where n is number of vertices

The maximum number of edges is greater in undirected graph than directed graph

User Ranu Vijay
by
5.0k points
Ask a Question
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.

5.1m questions

6.7m answers

Other Questions

What is the first step you would take to create a table of authorities?
In Java a final class must be sub-classed before it. ?? True ?? False
To apply a style to a paragraph, the first step is to position the insertion point in the paragraph. True or False
What machine listens for HTTP requests to come in to a website’s domain?
Certain files, such as the ____ and Security log in Windows, might lose essential network activity records if power is terminated without a proper shutdown. a. Event log b. Password log c. Word log d.
Link Copied!