NAME: NUR SYATHIRAH BINTI YUNUS

MATRIC NUMBER: A19BE0201

COURSE WORK: NETWORK ANALYSIS TERMINOLOGY

Find a diagram that represent each of the terminology.

No. Term Descriptions

A point location considered as a network node. Vertices are typically either distinct points or the end
points or intersection points of lines or polylines. Note that intermediate points along a polyline are not
generally vertices.

1 Vertex

A graph with 10 vertices (or nodes) and 11 edges (links).

 A (directed or undirected) link between two vertices that are directly connected is called an edge. An
undirected edge is determined by an unordered sequence of vertices, e.g. (3,8), which is the same as (8,3)
whereas for a directed edge the order of the sequence matters, with (3,8) being from 3 to 8. An indirect
link (via one or more other vertices) is not an edge. Edges are sometimes referred to as links or arcs.

2 Edge

A directed network with 10 nodes (or vertices) and 13 edges (or links).
 In an undirected graph the number of edges meeting at a vertex. In a directed graph the degree usually
refers to number of edges directed to a vertex (the indegree) minus the number of edges directed from a
vertex (the outdegree).

Degree (of a
3
vertex)

The node at the centre of the cluster in the upper right would have a high degree centrality, even though
it is far from the dense centre of the network.
 A collection of vertices and edges constitutes a graph. Directed graphs are graphs that include one or
more directed edges. If all edges are directed such graphs are known as digraphs. The mathematical study
of the properties of graphs and paths through graphs is known as graph theory.

4 Graph

Example of a graph formed by edges contributing to different vertices.

5 Path A (network) path is a sequence of connected edges between vertices.

 An example project network with the critical path equal to 22 time periods.

6 Connected graph If at least one path exists between every vertex and every other vertex in a graph it is described as
connected. A fully connected graph is one in which every vertex is directly connected to every other
 vertex. In such a graph, if there are n vertices there are n(n-1)/2 edges, assuming all edges are undirected.

A graph with two well connected clusters, loosely connected one with the other.

7 Connectivity Network connectivity is the minimum number of nodes or links that must fail in order to partition the
network (or sub-network) into two or more disjoint networks. The larger the connectivity for a network
 the better the network is able to cope with failures. In the realworld network nodes and links do fail (e.g.
roads require maintenance or an accident may block a link or junction). When nodes or links failed the
network should continue to function with reduced capacity. Network connectivity is a measure of the
resiliency of a network and its ability to continue to support traffic flows despite such problems.

This graph becomes disconnected when the dashed edge is removed.

8 Planar graph If a graph can be drawn in the plane (embedded) in such a way as to ensure edges only intersect at points
that are vertices then the graph is described as planar.
 A graph is said to be planar if it can be drawn in a plane so that no edge cross.

9 Network A collection of vertices and edges together with associated attribute data that may be represented and
analyzed using graph theoretic methods. A network is often defined as a graph that has at least one real-
valued attribute or weight (e.g. length) associated with every edge.
 Consists of a set of nodes connected by branches.

10 Diameter The maximum number of links that must be traversed to reach any node along a shortest path. Networks
with small diameters are generally faster to traverse.
 To what extent each individual node in the network can easily communicate with any other node in the
network.

11 Cycle A path from a given vertex to itself that traverses other vertices is a cycle. A graph that has no cycles is
called acyclic.
 Example of the shortest path and shortest cycle. This figure intuitively presents an example of the path.

12 Tree An n-vertex acyclic network or subnetwork in which every vertex is connected, for which the number of
edges is n-1. A unique path exists between every pair of vertices in a tree.
There is one and only one path between every pair of vertices, then graph is called as a tree.