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
A bijective correspondence between two graphs that preserves their incidence data; for simple graphs this is equivalently preservation of adjacency.
diestel-graph-theoryEach relation below ends at this concept.
This 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-theoryThis is an authored directed relation from the source endpoint to the target endpoint.
For undirected multigraphs an isomorphism preserves the vertex-edge incidence relation and therefore respects loops and edge multiplicities when those are part of the chosen graph model.
The target represents a state, property, observable, or state-dependent description associated with the source system or theory.
diestel-graph-theoryEach relation below starts at this concept.
No direct relations are authored in this direction.