Graph Mining Flashcards
1
Q
What is the eccentricity of a vertex?
A
Maximum distance to any other vertex.
2
Q
What is the radius of a connected graph?
A
The minimum eccentricity of any vertex
3
Q
What is the diameter of a connected graph?
A
Maximum eccentricity of any vertex.
4
Q
What is the effective diameter of a graph?
A
Smallest number that is larger than the eccentricity of a large fraction of the vertices in the graph.
5
Q
What is the integer in the Girvan Newman algorithm.
A
It is the number of shortest paths of any node to the root node.
