Keyboard graph navigation: press N for concepts or E for relations; use arrow keys, Home, and End to move; Enter selects; Shift plus Enter selects and centers; plus and minus zoom; zero fits; Escape clears the selection. Use the visible viewport buttons as alternatives to dragging, wheel, and pinch gestures.
Canonical static concept record
Open this concept in the interactive graphRead the Markdown equivalent
An undirected graph with no loops or parallel edges.
wp-simple-graphdiestel-graph-theoryEach relation below ends at this concept.
This is an authored directed relation from the source endpoint to the target endpoint.
Restrict the broad incidence graph to loopless graphs with at most one edge occurrence per unordered vertex pair.
Keep the existing data and select the subclass satisfying an additional law, existence condition, finiteness condition, or other property.
wp-simple-graphdiestel-graph-theoryEach relation below starts at this concept.
This is an authored directed relation from the source endpoint to the target endpoint.
Require every pair of distinct vertices to be adjacent.
Keep the existing data and select the subclass satisfying an additional law, existence condition, finiteness condition, or other property.
wp-complete-graphnlab-complete-graphdiestel-graph-theoryThis is an authored directed relation from the source endpoint to the target endpoint.
Require the nonempty simple graph to contain a path between every pair of vertices.
Keep the existing data and select the subclass satisfying an additional law, existence condition, finiteness condition, or other property.
wp-connected-graphnlab-connected-graphdiestel-graph-theoryThis is an authored directed relation from the source endpoint to the target endpoint.
Choose a color set and a vertex-labeling map whose values differ across every edge.
Equip an existing carrier or structured object with additional chosen data, when such compatible data exists. Use a construction junction when several independently meaningful inputs must coexist on the same carrier or interact compatibly.
wp-graph-coloringnlab-vertex-coloringdiestel-graph-theoryThis is an authored directed relation from the source endpoint to the target endpoint.
Two simple graphs are isomorphic when a bijection of vertices sends adjacent pairs exactly to adjacent pairs, so graph invariants must be unchanged by the bijection.
The target represents a state, property, observable, or state-dependent description associated with the source system or theory.
diestel-graph-theory