Professional Documents
Culture Documents
Graph Theory 1-11 PDF
Graph Theory 1-11 PDF
• Network = graph
Network/Graph
• Informally a graph is a set of nodes
Theory joined by a set of lines or arrows.
1 1 2 3
2 3
4 5 6 4 5 6
Protein-Protein Interaction
Genetic interaction network Networks
Gustav Kirchhoff
Hamiltonian cycles in Platonic graphs
• V:={1,2,3,4,5,6}
• E:={{1,2},{1,5},{2,3},{2,5},{3,4},{4,5},{4,6}}
.5
Structures and structural
metrics Graph structures
Identify interesting sections of a graph
Graph structures are used to isolate
Interesting because they form a significant
interesting or important sections of a
Connectivity Component
• a graph is connected if • Every disconnected graph can be split
– you can get from any node to any other by up into a number of connected
following a sequence of edges OR
components.
– any two nodes are connected by a path.
outdeg(2)=2
indeg(2)=2
Path Cycle
• A path is a walk in which all the edges and all
the nodes are different. • A cycle is a closed path in which all the
edges are different.
• Null graph
– No nodes
– Obviously no edge
Special Trees Regular
Connected Graph
Paths
All nodes have the same
degree
Stars
Bipartite graph
Special Regular Graphs: Cycles
• V can be partitioned
into 2 sets V1 and V2
such that (u,v)∈E
implies
– either u ∈V1 and v ∈V 2
C3 C4 C5 – OR v ∈V 1 and u∈V2.
Stars
Planar Graphs Subgraph
• Can be drawn on a plane such that no two edges • Vertex and edge sets are subsets of
intersect
those of G
• K4 is the largest complete graph that is planar
– a supergraph of a graph G is a graph that
contains G as a subgraph.
Special Subgraphs:
Subgraphs: Cliques Spanning subgraph
A clique is a maximum complete • Subgraph H has the same vertex set as
connected subgraph. G.
– Possibly not all the edges
A B C
– “H spans G”.
D E F
G H I
Isomorphism
Spanning tree
Let G be a connected graph. Then a • Bijection, i.e., a one-to-one mapping:
spanning tree in G is a subgraph of G f : V(G) -> V(H)
that includes every node and is also a u and v from G are adjacent if and only
tree. 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 Representation (Matrix)
1
1,2 1,5 2,3 2,5 3,4 4,5 4,6
1 1 0 0 0 0 0
• Edge List
2 1 0 1 1 0 0 0
– pairs (ordered if directed) of vertices
3 0 0 1 0 1 0 0
4 0 0 0 0 1 1 1 – Optionally weight and other data
5 0 1 0 1 0 1 0
6 0 0 0 0 0 0 1 • Adjacency List (node list)
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
N = 12
Random Graphs
Distance Matrix
Erdős and Renyi (1959)
p = 0.0 ; k = 0
N nodes
|V | matrix D = ( dij ) such that
|V | x |V
dij is the topological distance between i and j . A pair of nodes has
probability p of being
connected.
p = 0.09 ; k = 1
1 2 3 4 5 6
1 0 1 2 2 1 3 Average degree, k ≈ pN
2 1 0 1 2 1 3
3 2 1 0 1 2 2 What interesting things can
be said for different values
4 2 2 1 0 1 1 of p or k ? p = 1.0 ; k ≈ ½N 2
(that are true as N ∞)
5 1 1 2 1 0 2
6 3 3 2 1 2 0
p = 0.09 ; k = 1
0
– We live in a “small world” where within a few links, we are
For k > 1: 1.0 k connected to anyone in the world.
– almost all nodes connected
– diameter shrinks – Erdős and Renyi showed that average
– path lengths shorten phase transition path length between connected nodes is
links more likely when two links more likely when two
Clustering coefficient /
α
The Beta Model The Beta Model Jonathan
Donner
Kentaro
Toyama
Watts and Strogatz (1998) Watts and Strogatz (1998) Nobuyuki
Hanaki
Searchable Networks
Kleinberg (2000)
Ramin
Zabih
b)
c)
–
–
–
–
Searchable Networks
Kleinberg (2000)
References