THE MAXIMUM CONNECTIVITY OF A GRAPH,
RAND CORP SANTA MONICA CALIF
Pagination or Media Count:
The paper solves the problem of the maximum connectivity of any graph with a given number of points and lines. In addition, the minimum connectivity. The maximum diameter, and the minimum diameter are obtained. Two unsolved problems concerning the distribution of the values of the connectivity and the diameter are included.