Graph: Difference between revisions
Jump to navigation
Jump to search
| Line 37: | Line 37: | ||
[[Subordinate concept]]s (parts) are: | [[Subordinate concept]]s (parts) are: | ||
* [[Triple]] | * [[Triple]] | ||
* [[Vertex]] | ** [[Vertex]] | ||
* [[Edge]] | ** [[Edge]] | ||
=References= | =References= | ||
[[Category:All]] | [[Category:All]] | ||
Revision as of 22:16, 18 December 2022
Definition
A graph is a structure amounting to a set of vertices in which some pairs of these edges have a relationship. [1]
Synonym
- Network
Generic relations
In Generic relations. superordinate concepts and subordinate concepts can be distinguished:
- Structure
Subordinate concepts 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: