| title | date | draft | tags | categories | |||
|---|---|---|---|---|---|---|---|
Algorithm4 Java Solution 4.1.01 |
2020-01-28 06:59:15 +0800 |
false |
|
|
What is the maximum number of edges in a graph with V vertices and no parallel edges?
What is the minimum number of edges in a graph with V vertices, none of which are isolated?
V*(V-1)/2
for a graph, a veritex can link to v-1 vertices, and edges are bilateral,
so the maximum number of edges are v*(v-1) / 2.
V