  In this note we elaborate on some notions of surface area for discrete graphs
which are closely related to the inverse degree. These notions then naturally
lead to an associated connectivity measure of graphs and to the definition of a
special class of large graphs, called social graphs, that might prove
interesting for applications, among others, in computer science.
