contiguous_usa — Contiguous states (USA)

Description

A network of the 48 contiguous states of the USA and the District of Columbia, in which each node is a state (or the District of Columbia), and an edge connects two states that share a land border. The data were compiled by D. E. Knuth and distributed with the Stanford GraphBase as the "contiguous USA" graph used in The Art of Computer Programming. The two states not connected by land with the others (Alaska and Hawaii) are not included. The source does not document how borders meeting at a single point (e.g. the Four Corners of Arizona, Colorado, New Mexico and Utah) are treated; in the data, such diagonal pairs are not adjacent.

The network has the following properties:

Nodes: name, the two-letter postal code of the state (DC for the District of Columbia).

Tags

Transportation Roads Unweighted

Citation

D. E. Knuth, "The Stanford GraphBase: A Platform for Combinatorial Computing." ACM Press, New York (1993) www-cs-faculty.stanford.edu

Upstream URL OK

https://www-cs-faculty.stanford.edu/~knuth/sgb.html

Networks

Tip: hover over a column header for a description.

Column legend

$\left<k\right>$: Mean degree
$\sigma_k$: Standard deviation of the degrees
$\lambda_h$: Largest eigenvalue of the Hashimoto (non-backtracking) matrix
$\tau$: Random walk mixing time
$r$: Degree assortativity
$c$: Global clustering coefficient
$\oslash$: (Pseudo-) diameter
$S$: Relative size of the largest component
NPs: Node properties
EPs: Edge properties

Name	Nodes	Edges	$\left<k\right>$	$\sigma_k$	$\lambda_h$	$\tau$	$r$	$c$	$\oslash$	$S$	Kind	Mode	NPs	EPs	gt	GraphML	GML	csv
contiguous_usa	49	107	4.37	1.57	4.17	33.83	0.23	0.41	11	1.00	Undirected	Unipartite			2 KiB	3 KiB	3 KiB	2 KiB

Ridiculograms^*

^* These are automatically generated force-directed visualizations, and can be quite meaningless for networks both big and small. They should not be taken seriously as sources of scientific insight. See here for a discussion.