Register

Graph

217 views
1 votes
1 votes
Find Maximum and Minimum no of edges in a graph G with n vertices if G has 3 component with 2 non acyclic and 1 acyclic component?
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
Malusi asked Jan 12
108 views
Consider a weighted undirected graph with positive edge weights and let (u, v) be an [2] edge in the graph. It is known that the shortest path from source vertex r to u has weight 53 and shortest path from r to v has weight 65. Which statement is always true?
Consider a weighted undirected graph with positive edge weights and let (u, v) be an edge in the graph. It is known that the shortest path from source vertex r to u hasw...
User Avatar
0 votes
0 votes
1 answer
3
Dknights asked Dec 12, 2023
415 views
Regular and complete graph
which of the following statements is true: a complete graph is $(N-1)$ regular a $(N-1)$ regular is a complete graph
which of the following statements is true:a complete graph is $(N-1)$ regulara $(N-1)$ regular is a complete graph
User Avatar
1 votes
1 votes
1 answer
4
suryansh rajput asked Oct 2, 2023
198 views
Graph Theory
User Avatar
Link Copied!