A measure of connectedness in graph theory From Wikipedia:

A complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique edge.



A tree is an undirected graph in which any two vertices are connected by exactly one path.


To me, these two types of graphs seem like some kind of opposites in terms of connectivity. I have been searching online for a graph property that reflects this difference, like Wiener index, circuit rank, strength, etc. 
I couldn't find a property that measures the thing I desire: something like an averaged number that defines a node's connectivity to more than 1 node. A normalized value that should be minimum for a tree e.g. ~0 and maximum for a complete graph e.g. ~1.
Does such a measure exist in literature?
 A: Some relevant metrics are described here. First, there is the connectivity, which describes the number of vertices you need to remove to make the graph disconnected. In the case of a tree with 3 or more vertices, this is 1. In the case of a complete graph, it is V. And in a disconnected graph it's 0, so it's easy to normalize. A similar property holds if you replace the number of vertices to remove with the number of edges to remove.
A metric which is a bit more of a global property is the average connectivity, given by computing the minimum number of edges between any two vertices $\kappa(u, v)$ that you need to remove to cause the graph to be disconnected and averages over all pairs: $$\frac{\sum_{u\neq v\in V}\kappa(u,v)}{\binom{|V|}{2}}.$$
The first source also defines an analogous vertex connectivity, though I don't understand their definition for vertex connectivity when $u$ and $v$ are adjacent.
Another idea I think could be interesting, but I don't know that anyone has ever really researched is the expected number of edges/vertices that need to be removed to disconnect the graph, if you choose randomly.
