Graph theory


Complicated relations between different objects/phenomena can be visualized with graphs.
a graph G is defined as an ordered pair of sets G = (V,E). where E is an ordered pair {a, b}, a,b ∈V. e.g. constitutes a pair of element in V. 

The elements in V are called nodes or vertices.

The elements in are the arcs or edges of the graph. The arc e = {a,b} connects the nodes a and b or it is incident with a and b. a and b are then called end-points to the arc ab. The nodes a and b are adjacent if  ab is an arc in the graph.

Arcs starting and ending in the same node are called loops.  

aan arc not incident with a node is called isolated.

Only one arc is allowed to run between two nodes.

Annonser

Om mattelararen

Licentiate of Philosophy in atomic Physics Master of Science in Physics
Det här inlägget postades i Uncategorized. Bokmärk permalänken.

Kommentera

Fyll i dina uppgifter nedan eller klicka på en ikon för att logga in:

WordPress.com Logo

Du kommenterar med ditt WordPress.com-konto. Logga ut / Ändra )

Twitter-bild

Du kommenterar med ditt Twitter-konto. Logga ut / Ändra )

Facebook-foto

Du kommenterar med ditt Facebook-konto. Logga ut / Ändra )

Google+ photo

Du kommenterar med ditt Google+-konto. Logga ut / Ändra )

Ansluter till %s