graph_glossary — Graph theory glossary (2001)
- Description
The network of the terms of Bill Cherowitzo's Graph and Digraph Glossary (version of February 3, 2001, prepared for a course on graph theory at the University of Colorado at Denver), converted into a network by B. Zemljič. A directed edge points from a term X to a term Y if Y is used to describe the meaning of X in the glossary. The data contain 114 such directed relations and 4 undirected ones (terms that describe each other), which are represented here as pairs of reciprocal edges.
The network has the following properties:
- (Node)
name: the term.
- (Node)
- Tags
- Informational Language Unweighted Metadata
- Added
- 2026-10-25
- Citation
-
- B. Cherowitzo, "Graph and Digraph Glossary." University of Colorado at Denver (2001) web.archive.org
- Upstream URL OK
- https://web.archive.org/web/20040331022152/http://vlado.fmf.uni-lj.si/pub/networks/data/DIC/TG/glossTG.htm
- 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
- Ridiculograms*