Embedded Files
LESSON LEARNING OUTCOME:
LESSON LEARNING OUTCOME:
At the end of this lesson, students will be able to:
Derive the concept of graphs.
Identify the graphs terminology.
Construct graphs representation.
CONCEPT OF GRAPHS
CONCEPT OF GRAPHS
A graph G = (V, E) consists of V, a non-empty set of vertices (also known as nodes/points) and E, a set of edges (also known as lines). Each edge has either one or two vertices associated with it, called endpoints. An edge is said to connect its endpoint.
PROPERTIES OF GRAPH
PROPERTIES OF GRAPH
Loop - The edge linking vertex to itself
Multiple edge or parallel edge - Two edges that linking with the same vertices.
Size - The number of vertices
Degree of vertex - The number of edges for each vertex.
Loop: Degree count as 2.
Isolated: Degree count as 0.
Pendant: Degree count as 1.
Path - A journey with edge appears only once in the edge sequence.
Cycle/circuit - A path that begin and end at the same vertex.
Adjacent - A pair of vertices that sharing the same edge. (focus on the vertex)
Incident - The edge that joins the vertex. (focus on the edge)
Length – add all the weighted edge on weighted graph.
Graph G
EXAMPLE (refer Graph G above)
EXAMPLE (refer Graph G above)
Loop - e7 & e8
Multiple edge or parallel edge - e1 & e2
Size - 6
Degree of vertex -
Vertex A - 4
Vertex B - 2
Vertex C - 0
Vertex D - 1
Vertex E - 6
Vertex F - 5
Loop: Vertex F & E
Isolated: Vertex C
Pendant: Vertex D
Adjacent - one of the adjacent is as follows:
Vertex A & vertex E are adjacent to vertex B
Incident - one of the incident is as follows:
Vertex A - e1, e2, e3, e4
GRAPHS TERMINOLOGY & REPRESENTATION
GRAPHS TERMINOLOGY & REPRESENTATION
EXERCISE WEEK 6
EXERCISE WEEK 6
Practice Graph Concept.pdfWEEK 6 ACTIVITY
WEEK 6 ACTIVITY
Scan the QR Code on the right for Week 6 activity.
Or click on the link below:
Real world application of Graphs
Real world application of Graphs
Page updated
Report abuse