I- Introduction to Network

Theory:
Basic Concepts
What is a Network?
 Network = graph
 Informally a graph is a set of nodes
joined by a set of lines or arrows.

1 1 2 3
2 3

4 5 6 4 5 6
 Graph-based representations

 Representing a problem as a graph can

provide a different point of view
 Representing a problem as a graph can
make a problem much simpler
 More accurately, it can provide the
appropriate tools for solving the problem
 What is network theory?
 Network theory provides a set of
techniques for analysing graphs
 Complex systems network theory provides
techniques for analysing structure in a
system of interacting agents, represented
as a network
 Applying network theory to a system
means using a graph-theoretic
representation
 What makes a problem graph-like?

 There are two components to a graph

 Nodes and edges
 In graph-like problems, these components
have natural correspondences to problem
elements
 Entities are nodes and interactions between
entities are edges
 Most complex systems are graph-like
Friendship Network
Scientific collaboration network
Business ties in US biotech-
industry
Genetic interaction network
Protein-Protein Interaction
Networks
Transportation Networks
Internet
Ecological Networks
Graph Theory - History
Leonhard Euler's paper
on “Seven Bridges of
Königsberg” ,
published in 1736.
Graph Theory - History
Cycles in Polyhedra

Thomas P. Kirkman William R. Hamilton

Hamiltonian cycles in Platonic graphs

 Graph Theory - History
Trees in Electric Circuits

Gustav Kirchhoff
 Graph Theory - History
Enumeration of Chemical Isomers

Arthur Cayley James J. Sylvester George Polya

 Graph Theory - History
Four Colors of Maps

Francis Guthrie Auguste DeMorgan

Definition: Graph

 G is an ordered triple G:=(V, E, f)

 V is a set of nodes, points, or vertices.
 E is a set, whose elements are known as
edges or lines.
 f is a function
 maps each element of E
 to an unordered pair of vertices in V.
Definitions
 Vertex
 Basic Element
 Drawn as a node or a dot.
 Vertex set of G is usually denoted by V(G), or V
 Edge
 A set of two elements
 Drawn as a line connecting two vertices, called
end vertices, or endpoints.
 The edge set of G is usually denoted by E(G), or
E.
Example

 V:={1,2,3,4,5,6}
 E:={{1,2},{1,5},{2,3},{2,5},{3,4},{4,5},{4,6}}
 Simple Graphs
Simple graphs are graphs without
multiple edges or self-loops.
 Directed Graph (digraph)
 Edges have directions
 An edge is an ordered pair of nodes

loop
multiple arc

arc node
 Weighted graphs

 is a graph for which each edge has an

associated weight, usually given by a
weight function w: E  R.

1.2 2
1 2 3 1 2 3
.2
.5 1.5 5 3
.3 1
4 5 6 4 5 6

.5
 Structures and structural
metrics
 Graph structures are used to isolate
interesting or important sections of a
graph
 Structural metrics provide a measurement
of a structural property of a graph
 Global metrics refer to a whole graph
 Local metrics refer to a single node in a graph
 Graph structures
 Identify interesting sections of a graph
 Interesting because they form a significant
domain-specific structure, or because they
significantly contribute to graph properties
 A subset of the nodes and edges in a
graph that possess certain characteristics,
or relate to each other in particular ways
Connectivity

 a graph is connected if
 you can get from any node to any other by
following a sequence of edges OR
 any two nodes are connected by a path.

 A directed graph is strongly connected if

there is a directed path from any node to any
other node.
Component

 Every disconnected graph can be split

up into a number of connected
components.
 Degree

 Number of edges incident on a node

The degree of 5 is 3
Degree (Directed Graphs)
 In-degree: Number of edges entering
 Out-degree: Number of edges leaving

 Degree = indeg + outdeg

outdeg(1)=2
indeg(1)=0

outdeg(2)=2
indeg(2)=2

outdeg(3)=1
indeg(3)=4
Degree: Simple Facts

 If G is a graph with m edges, then

 deg(v) = 2m = 2 |E |
 If G is a digraph then
 indeg(v)= outdeg(v) = |E |
 Number of Odd degree Nodes is even
 Walks

A walk of length k in a graph is a succession of k

(not necessarily different) edges of the form

uv,vw,wx,…,yz.

This walk is denote by uvwx…xz, and is referred to

as a walk between u and z.

A walk is closed is u=z.

 Path
 A path is a walk in which all the edges and all
the nodes are different.

Walks and Paths

1,2,5,2,3,4 1,2,5,2,3,2,1 1,2,3,4,6
walk of length 5 CW of length 6 path of length 4
Cycle

 A cycle is a closed walk in which all the

edges are different.

1,2,5,1 2,3,4,5,2
3-cycle 4-cycle
Special Types of Graphs

 Empty Graph / Edgeless graph

 No edge

 Null graph
 No nodes
 Obviously no edge
Trees

 Connected Acyclic Graph

 Two nodes have exactly

one path between them
Special Trees

Paths

Stars
 Regular
Connected Graph

All nodes have the same

degree
Special Regular Graphs: Cycles

C3 C4 C5
Bipartite graph

 V can be partitioned
into 2 sets V1 and V2
such that (u,v)E
implies
 either u V1 and v V2
 OR v V1 and uV2.
Complete Graph

 Every pair of vertices are adjacent

 Has n(n-1)/2 edges
Complete Bipartite Graph

 Bipartite Variation of Complete Graph

 Every node of one set is connected to
every other node on the other set

Stars
 Planar Graphs
 Can be drawn on a plane such that no two edges
intersect
 K4 is the largest complete graph that is planar
Subgraph

 Vertex and edge sets are subsets of

those of G
 a supergraph of a graph G is a graph that
contains G as a subgraph.
Special Subgraphs: Cliques

A clique is a maximum complete

connected subgraph.
A B C

D E F

G H I
Spanning subgraph

 Subgraph H has the same vertex set as

G.
 Possibly not all the edges
 “H spans G”.
 Spanning tree
 Let G be a connected graph. Then a
spanning tree in G is a subgraph of G
that includes every node and is also a
tree.
Isomorphism

 Bijection, i.e., a one-to-one mapping:

f : V(G) -> V(H)
u and v from G are adjacent if and only
if f(u) and f(v) are adjacent in H.
 If an isomorphism can be constructed
between two graphs, then we say those
graphs are isomorphic.
 Isomorphism Problem

 Determining whether two

graphs are isomorphic
 Although these graphs look
very different, they are
isomorphic; one isomorphism
between them is
f(a)=1 f(b)=6 f(c)=8 f(d)=3
f(g)=5 f(h)=2 f(i)=4 f(j)=7
 Representation (Matrix)

 Incidence Matrix
 VxE
 [vertex, edges] contains the edge's data
 Adjacency Matrix
 VxV
 Boolean values (adjacent or not)
 Or Edge Weights
Matrices
1,2 1,5 2,3 2,5 3,4 4,5 4,6
1 1 1 0 0 0 0 0
2 1 0 1 1 0 0 0
3 0 0 1 0 1 0 0
4 0 0 0 0 1 1 1
5 0 1 0 1 0 1 0
6 0 0 0 0 0 0 1
1 2 3 4 5 6
1 0 1 0 0 1 0
2 1 0 1 0 1 0
3 0 1 0 1 0 0
4 0 0 1 0 1 1
5 1 1 0 1 0 0
6 0 0 0 1 0 0
Representation (List)

 Edge List
 pairs (ordered if directed) of vertices
 Optionally weight and other data
 Adjacency List (node list)
Implementation of a Graph.

 Adjacency-list representation
 an array of |V | lists, one for each vertex in
V.
 For each u  V , ADJ [ u ] points to all its
adjacent vertices.
Edge and Node Lists
Edge List Node List
12 122
12 235
23 33
25 435
33 534
43
45
53
54
Edge Lists for Weighted
Graphs

Edge List
1 2 1.2
2 4 0.2
4 5 0.3
4 1 0.5
5 4 0.5
6 3 1.5
 Topological Distance

A shortest path is the minimum path

connecting two nodes.

The number of edges in the shortest path

connecting p and q is the topological
distance between these two nodes, dp,q
 Distance Matrix

|V | x |V | matrix D = ( dij ) such that

dij is the topological distance between i and j.

1 2 3 4 5 6
1 0 1 2 2 1 3
2 1 0 1 2 1 3
3 2 1 0 1 2 2
4 2 2 1 0 1 1
5 1 1 2 1 0 2
6 3 3 2 1 2 0
 References
Aldous & Wilson, Graphs and Applications. An
Introductory Approach, Springer, 2000.
WWasserman & Faust, Social Network Analysis,
Cambridge University Press, 2008.
 Exercise 1

Which of the following statements hold for this graph?

(a)nodes v and w are adjacent;

(b)nodes v and x are adjacent;
(c)node u is incident with edge 2;
(d)Edge 5 is incident with node x.
Exercise 2

Are the following two graphs isomorphic?

 Exercise 3

Write down the degree sequence of each of the following

graphs:

(a) (b)
 Exercise 3

Complete the following statements concerning the graph

given below:
(a) xyzzvy is a _______of length____between___and__;
(b) uvyz is _________of length ____between___and__.
 Exercise 4

Write down all the paths between s and y in the following

graph. Build the distance matrix of the graph.
 Exercise 5

Draw all the non-isomorphic trees with 6 nodes.

 Exercise 6

Draw the graphs given by the following representations:

Node list Edge list Adjacency matrix

1234 12 1 2 3 4 5
24 14 1 0 2 0 1 1
34 22 2 2 0 0 1 1
4123 24 3 0 0 0 0 0
56 24 4 1 1 0 0 2
65 32 5 1 1 0 2 0
43
 Exercise 7*

(a) Complete the following tables for the number of walks of

length 2 and 3 in the above digraph.

(b) Find the matrix products A2 and A3, where A is the

Adjacency matrix of the above digraph.
(c) Comment on your results.