Graph: Difference between revisions
Jump to navigation
Jump to search
| Line 13: | Line 13: | ||
[[Subordinate concept]]s A are: | [[Subordinate concept]]s A are: | ||
* [[Knowledge graph]] | |||
[[Subordinate concept]]s B are: | |||
* Directed graph | * Directed graph | ||
* Mixed graph | * Mixed graph | ||
* Weighted graph | * Weighted graph | ||
[[Subordinate concept]]s | [[Subordinate concept]]s C are: | ||
* Oriented graph | * Oriented graph | ||
* Regular graph | * Regular graph | ||
Revision as of 21:52, 18 December 2022
Definition
A graph is a structure amounting to a set of concepts in which some pairs of these concept have a relationship. [1]
Synonym
- Network
Generic relations
In Generic relations. superordinate concepts and subordinate concepts can be distinguished:
- Structure
Subordinate concepts A are:
Subordinate concepts B are:
- Directed graph
- Mixed graph
- Weighted graph
Subordinate concepts C 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: