Daily tweets about networks, graph theory, and related topics from @JohnDCook

Joined July 2013
Two nodes x and y in a directed graph are weakly connected if there is a path from x to y or from y to x.
4
1,314
Gallery of named graphs altermundus.fr/downloads/doc… // 104-page pdf from Alain Matthes
4
1,446
A connected graph contains an Eulerian path iff there are zero or two nodes of odd degree.
2
11
1,586
A Hamiltonian path visits each vertex in a graph exactly once.
2
17
1,463
An Eulerian path traverses each edge in a graph exactly once.
5
15
1,461
Some authors say graph theory started with Euler's solution to the Kӧnigsberg bridge problem in 1736.
11
1,473
The diameter of a connected graph is the length of the longest geodesic path in the graph.
2
15
1,625
If A is the adjacency matrix of a graph, the number of walks from i to j of length r is the ij-th entry of A^r.
8
1,499
The density of a graph is the ratio of the actual number of edges to the maximum possible number of edges.
2
13
1,492
The degree of a vertex is the number of edges connected to it.
2
11
1,532
The number of spanning trees in a connected network w/ n nodes equals the product of the nonzero eigenvalues of its Laplacian, divided by n.
3
16
1,548
DAG stands for directed acyclic graph.
2
20
1,527