Register

Diameter of a graph and tree

• recategorized by
704 views
0 votes
0 votes
Why there is a difference between diameter of a graph and tree?

Diameter of a tree as i have read is the maximum path between two vertices(number of edges between two vertices)

But for tree it says number of nodes on the longest path.

But tree is a graph so why cant i find the diameter of tree in similar way?
• recategorized by
User Avatar

1 Answer

0 votes
0 votes
i think diameter has same meaning in tree as well the number of on the longest path means distance between the a particular node to leaf node becoz that path will be longest one here
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
0 answers
1
Akriti sood asked Dec 29, 2016
2,436 views
diameter of a graph
FINDING diameter of a graph- i could think of 2 options for finding diameter- 1) running BFS from each vertex and then finding longest among then 2) computing all pair shortest paths (by floyd warshall) and then finding longest among them is there any other method or algo?can DFS be used to find diameter? please suggest.
FINDING diameter of a graph-i could think of 2 options for finding diameter-1) running BFS from each vertex and then finding longest among then2) computing all pair short...
User Avatar
2 votes
2 votes
1 answer
2
Anuanu asked Jun 2, 2016
12,465 views
a graph with n vertices and n-1 edges that is not a tree is called
User Avatar
0 votes
0 votes
2 answers
3
sripo asked Dec 25, 2018
4,808 views
In a 3-array tree if internal nodes have exactly 3 children,the number of leaf nodes will be __ ?
In a 3-array tree if internal nodes have exactly 3 children,the number of leaf nodes will be __ ? Does it vary for binary tree? What do you mean by internal nodes? Non root node and leaf node?
In a 3-array tree if internal nodes have exactly 3 children,the number of leaf nodes will be __ ?Does it vary for binary tree?What do you mean by internal nodes? Non roo...
User Avatar
0 votes
0 votes
2 answers
4
yuuchan asked Jul 22, 2023
547 views
Ace workbook: If G is a complete bipartite graph with n vertices (n >= 2) and minimum number of edges, then matching number of G is ____
If G is a complete bipartite graph with n vertices (n >= 2) and minimum number of edges, then matching number of G is ____1n-1⌊n/2⌋⌈n/2⌉
User Avatar
Link Copied!