November 2022

MATH IN NETWORKS
Presented by: Razonado and Dela Sierra
math in networks

ESSENTIAL LEARNINGS:
Students will understand the basic vocabulary of networks
Students will understand directed and undirected graphs

Introduction
A network is a set of objects (called vertices or nodes
or points) that are connected together.
The connections between the vertices are called
edges (or links or lines). In mathematics, networks are
often referred to as graphs which must be
distinguished from an alternative use of the graph to
mean a graph of a function or relation.
Networks are collections of points joined by lines
Network ≡ Graph
Network and graph only vary in terms
Math in Networks Wednesday, 2022 December 7

Basic concepts of a graph

We mean a graph G in network as an ordered pair of the set of vertices
(or nodes or points) which is non empty and denoted by V (G) and the
set of edges (or links or lines) which can be possibly empty and denoted
by E(G). That is, the graph G = (V (G), E(G)). The vertex set V (G) has its
elements called vertices (vertex for singular or nodes or points) with the
cardinality |V (G)| as the order of the graph G.
 Graph Element: Vertex
Vertices in plural. This is the "objects" or points of
a network.
It can be transmitting stations, computer servers,
places, people, and so on.
Also called node
 Graph Element: Edge

Indicate connections among objects

Lines and links
In real-life, it can be wires, roads, social
connections, etc.
Math in Networks Wednesday, 2022 December 7

Basic concepts of a graph

The edge set E(G) has its elements called edges(or links or lines) with the
cardinality |E(G)| as the size of the graph G. These graphs mentioned
here are simple undirected graphs. That is, the edge joining vertex u to
vertex v is the same edge from vertex v to vertex u. An edge e joining
vertices u and v is written, e = uv.
Math in Networks Wednesday, 2022 December 7

Basic concepts of a graph

In this case, vertices u and v are said to be adjacent and edge e is said
to be incident with vertex u and also incident with vertex v. The degree
of vertex v denoted by deg(v) is the number of incident edges with v. If
deg(v) = 0 then v is called an isolated vertex. If a graph G has an
isolated vertex then G is called a disconnected graph.
Math in Networks Wednesday, 2022 December 7

Undirected Graph

V(G) = {1,2,3,4,5,6,7,8,x}
The vertices 1,2,…,8 are each adjacent to vertex x.
Also, deg(x) = 8 and degree of each of the other vertices is 1.
Math in Networks Wednesday, 2022 December 7

Disconnected Graph

Graph H has an isolated vertex b, so, H is a disconnected graph.

Also, |V(H)| = 17 and |E(H)|=23

 Math in Networks Wednesday, 2022 December 7

Undirected Graph
When a graph has an unordered pair of vertices, it is an undirected
graph. In other words, there is no specific direction to represent the
edges. The vertices connect together by undirected arcs, which are
edges without arrows. If there is an edge between vertex A and vertex
B, it is possible to traverse from B to A, or A to B as there is no specific
direction.
Math in Networks Wednesday, 2022 December 7

Undirected Graph

G:

Set of vertices V(G) = {1, 2, 3, 4}

Set of edges E(G) = {(1, 2), (2, 1), (2, 3), (3, 2), (1, 3), (3, 1), (3, 4), (4, 3)}
 Math in Networks Wednesday, 2022 December 7

Directed Graph
When a graph has an ordered pair of vertices, it is called a directed
graph. The edges of the graph represent a specific direction from one
vertex to another. When there is an edge representation as (V1, V2), the
direction is from V1 to V2. The first element V1 is the initial node or the
start vertex. The second element V2 is the terminal node or the end
vertex.
 Math in Networks Wednesday, 2022 December 7

Directed Graph

G:

Set of vertices V(G) = {A, B, C, D, E, F}

Set of edges E(G) + {(A,B),(B,C),(C,E),(E,D),(D,B),(E,F)}
 Math in Networks Wednesday, 2022 December 7

Directed Graph

Digraph D has vertex set V(D)={𝑦1, 𝑦2 , 𝑦3, 𝑥1, 𝑥2, 𝑥3, 𝑥4 , 𝑥5}.
Its arc set A(D)={𝑎1, 𝑎2 , 𝑎3, 𝑎4, 𝑎5, … , 𝑎13, 𝑎14, 𝑎15},
with 𝑎1 = [𝑦1, 𝑥1], 𝑎2 = [𝑦1, 𝑥2] , 𝑎3 = [𝑦1, 𝑥3]
𝑎4 = [𝑦1, 𝑥4] , 𝑎5 = [𝑥5, 𝑦1] , 𝑎6 = [𝑥1, 𝑦2] ,…, and 𝑎15 = [𝑦3, 𝑥5]
Network elements: edges
Directed (also called arcs) A -> B
A likes B, A gave a gift to B, A is B’s child
Undirected A B or A – B
A and B like each other A and B are siblings A and B are co-authors

Edge attributes
weight (e.g. frequency of communication)
ranking (best friend, second best friend…)
type (friend, relative, co-worker)
properties depending on the structure of the rest of the graph: e.g. betweenness

Multiedge: multiple edges between two pair of nodes

Self-edge: from a node to itself
Node network properties

indegree how many directed edges (arcs) are incident on a node

outdegree how many directed edges (arcs) originate at a node
degree (in or out) number of edges incident on a node outdegree=2 indegree=3
degree=5 8

outdegree=2 indegree=3
Non-simple graphs
An edge connecting a vertex to itself is called a loop.
Multiple edges are more than one edge connecting
two vertices in a graph. A graph without a loop nor
multiple edges connecting any two of its vertices is
called a simple graph. Otherwise the graph is called
non simple.
Math in Networks Wednesday, 2022 December 7

Non-simple Graph

Graph G has a loop at vertex 𝑥1 and multiple edges connecting vertices

𝑥5 and 𝑦4
math in networks

ACTIVITY:
In relation to the topic, please get 1 whole sheet of paper and create your own
network of friends within this class. It should be undirected graph. Your name at
the center vertex and your friends adjacent to you. Indicate the cardinality of the
vertices and edges.
math in networks

ASSIGNMENT:
1. Janet invites her friends Alex, Bert, Cindy and Dale to a dinner. Alex, Bert, and Dale all know Cindy.
Construct the acquaintance graph of this group of people (which includes Janet). What is the order
and size of this acquaintance graph?
2. Six students A, B, C, D, E, and F went to the library once last Monday night. One of them stole a book.
Each student is questioned about whom they saw at the library, and all tell the truth except the thief (it
is possible that one student saw another without in turn being seen, but we assume that if one student
sees another an arc is drawn with arrow leaving the student who saw the other). That is, A saw B and E;
B saw A and F; C saw D and F; D saw A and F; E saw B and C and F saw C and E. Draw a directed graph
illustrating the given scenario. If the least number of occurrences being seen at the library makes a
person the most probable thief, then who is the thief?