Graph: Difference between revisions
Jump to navigation
Jump to search
| Line 1: | Line 1: | ||
=Definition= | =Definition= | ||
A graph is a structure amounting to a set of | A graph is a structure amounting to a set of [[concept]]s in which some pairs of these concept are related. | ||
<ref>Wikipedia: Graph (discrete methematics). [https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)] | <ref>Wikipedia: Graph (discrete methematics). [https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)] | ||
</ref> | </ref> | ||
Revision as of 21:33, 18 December 2022
Definition
A graph is a structure amounting to a set of concepts in which some pairs of these concept are related. [1]
Notes
Generic relations
In Generic relations. superordinate concepts and subordinate concepts can be distinguished:
- Structure
Subordinate concepta A are:
- Directed graph
- Mixed graph
- Weighted graph
Subordinate concepts B are:
- Oriented graph
- Regular graph
- Complete graph
- Finite graph
- Connected graph
- Bipartite graph
- Path graph
- Planar graph
- Cycle graph
- Tree
- Poly tree
- Advanced kinds of graphs
Partitive relations
In Partitive relations, superordinate concepts and subordinate concepts can be distinguished: Subordinate concepts (parts) are:
- Vertex
- Edge