- is a Node/Vertices... -------- is an arc, a number on an arc is the weight
Tree - All nodes are connected, but has no cycles
A Simple graph - there are no multiple arcs, no nodes are connected to themselves
Complete graph - All nodes are connected by precisely 1 arc to every other node
Planar - Arcs never cross, therefore they only meet eafch other at nodes.
Bipartite - 2 sets of nodes, and arcs only connect from 1 set to the other
Every arc has 2 ends so when N is a node the amount of arcs is 1/2 N(N-1)
Eularian - has an even order Eulars relationship - regions + nodes = arcs + 2
Semi Eularian - has exactly to odd orders ( odd number of arcs from a node)
Comments
No comments have yet been made