Search
Create
Log in
Sign up
Log in
Sign up
Graph Theory
STUDY
Flashcards
Learn
Write
Spell
Test
PLAY
Match
Gravity
Terms in this set (14)
Connected Graph
One which every vertex is linked by an edge or sequence of edges to every other vertex
Simple Graph
One which there are no loops and two vertices are connected directly by at most only one edge
Subgraph
A graph that exists within a graph using some of the vertices and nodes.
Total Degree of a network
2*number of edges
Trees
A tree is a connected graph with one less edge than the number of nodes. In a tree graph all nodes are connected and there is only one route between each vertex
Eularian Network
Where all the vertices have an even order
Semi-eularian network
Only 2 vertices with an odd degree
Non-eularian
Has more than 2 edges with an odd degree
Eularian Trail
A trail that uses all edges of a graph
Closed Eularian Trail
A Eularian trail that which starts and finishes at the same vertex
Hamiltonian Graph
A path that visits every node once and returns to the starting node
Complete Graph
One where every vertex is connected directly to every other vertex
Number of edges in a complete graph
1/2n(n-1)
Hamiltonian Cycles formula
1/2(n-1)!
YOU MIGHT ALSO LIKE...
D1
19 Terms
jonathanjrichmond
Network terminology
41 Terms
mollymoo179
Maths Networks
34 Terms
Samo_Kablamo
Maths Networks
42 Terms
AnnaKosterich
OTHER SETS BY THIS CREATOR
Behavioural Economics Key Terms
18 Terms
Charlie_Haskell
Micro Economics, The market mechanism, market failure and government intervention in markets
18 Terms
Charlie_Haskell
Micro Economics, The distribution of income and wealth
6 Terms
Charlie_Haskell
Micro Economics, The Labour Market
13 Terms
Charlie_Haskell
;