Graph: Difference between revisions

From Knowledge Management
Jump to navigation Jump to search
Line 1: Line 1:
=Definition=
=Definition=
A graph is a structure amounting to a set of [[concept]]s in which some pairs of these [[concept]]s have a [[relation]]ship.  
A graph is a structure amounting to a set of [[Vertex|vertices]]s in which some pairs of these [[edge]]s have a [[relation]]ship.  
<ref>Wikipedia: Graph (discrete methematics). [https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)]</ref>
<ref>Wikipedia: Graph (discrete methematics). [https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)]</ref>



Revision as of 22:12, 18 December 2022

Definition

A graph is a structure amounting to a set of verticess 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:

Superordinate concept is:

  • 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
Graph with 6 concepts and 7 relations.

Partitive relations

In Partitive relations, superordinate concepts and subordinate concepts can be distinguished:

Subordinate concepts (parts) are:

References

  1. Wikipedia: Graph (discrete methematics). [1]