Graph: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
|||
| Line 31: | Line 31: | ||
=Partitive relations= | =Partitive relations= | ||
In [[Partitive relation]]s, [[superordinate concept]]s and [[subordinate concept]]s can be distinguished: | In [[Partitive relation]]s, [[superordinate concept]]s and [[subordinate concept]]s can be distinguished: | ||
[[Subordinate concept]]s (parts) are: | [[Subordinate concept]]s (parts) are: | ||
* Vertex | * Vertex | ||
Revision as of 21:38, 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]
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