Graph: Difference between revisions
Jump to navigation
Jump to search
| Line 11: | Line 11: | ||
[[Superordinate concept]] is: | [[Superordinate concept]] is: | ||
* Structure | * Structure | ||
[[Subordinate concept]]a A are: | |||
* Directed graph | |||
* Mixed graph | |||
* Weighted graph | |||
[[Subordinate concept]]s 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= | =Partitive relations= | ||
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