Graph: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
|||
| Line 33: | Line 33: | ||
* Poly tree | * Poly tree | ||
* Advanced kinds of graphs | * Advanced kinds of graphs | ||
[[File:Graph2.png|thumb|Graph with 6 [[ | [[File:Graph2.png|thumb|Graph with 6 [[vertext|vertices]] and 7 [[edge]]s.]] | ||
=Partitive relations= | =Partitive relations= | ||
Revision as of 22:14, 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:
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: