§10.2 Graph Terminology 2.

Basic Terminology
1. Introduction page 651 (1) Definition 1 (page 651)
Two vertices u and v in an undirected
graph G are called adjacent (相邻的，
or neighbors) in G if {u,v} is an edge
of G.
If e={u,v}, the edge e is called incident (关
联的) with the vertices u and v. The
edge e is also said to connect u and v.
The vertices are called endpoints of
the edge {u, v}.

(3) Definition 3 (page 652)

The degree of a vertex in an undirected Example: Figure 1 (page 652)
graph is the number of edges incident For Graph G, deg(e)=3, deg(g)=0.
with it, except that a loop at a vertex For Graph H, deg(e)=6, deg(b)=6
contributes twice to the degree of the
vertex. The degree of the vertex v is
denoted by正在载⼊…
deg(v).
 A vertex of degree zero is called (4) The Handshaking Theorem
isolated. It follows that an isolated Let G=(V, E) be an undirected graph
vertex is not adjacent to any vertex. with e edges. Then
2e = ∑v∈
∈V deg(v)
A vertex is pending if and only if it has (Note that this applies even if multiple
degree one. Consequently, a pending edges and loops are present.)
正在载⼊…
vertex is adjacent to exactly one other
vertex. Example 3 (page 653): How many edges
are there in a graph with ten vertices
each of degree six?
Answer: e=30

(5) Theorem 2 (page 653)

(6) Definition 4 (page 654)
An undirected graph has an even (偶数)
When (u, v) is an edge of the graph G
number of vertices of odd (奇数) degree. with directed edge, u is said to be
Proof: adjacent to v and v is said to be
V1---- the set of vertices of an even degree adjacent from u.
V2---- the set of vertices of an odd degree The vertex u is called the initial vertex
of (u,v), and v is called the terminal or
2e = ∑v∈
∈V deg(v) end vertex of (u,v). The initial vertex
and terminal vertex of a loop are the
= ∑v∈
∈V1 deg(v) + ∑v∈
∈V2 deg(v)
same.
(7) Definition 5 (page 654) (7) Theorem 3 (page 654)
In a graph with directed edges the in- Let G=(V, E) be a graph with directed
degree of a vertex v (⼊度), denoted by edges. Then
deg-(v), is the number of edges with v as ∑v∈
∈V deg-(v) =∑v∈ ∈V deg+(v) = |E|
their terminal vertex.
The out-degree of v (出度), denoted by
deg+(v), is the number of edges with v as
their initial vertex .
Note: a loop at a vertex contributes 1 to
both the in-degree and the out-degree of
this vertex.

3. Some Special Simple Graphs (2) Example 6 (Cycles, page 655)

(1) Example 5 (Complete Graph, 完全图 The cycle Cn, n≥3, consists of n
page 655) vertices v1, v2, …, vn and edges {v1,
The complete graph on n vertices, v2}, {v2, v3}, … , {vn-1, vn}, and {vn,
denoted by Kn, is the simple graph that v1}.
contains exactly one edge between
正在载⼊…
each pair of distinct vertices.
(3) Example 7 (Wheels, 轮, page 655) (4) Example 8 (n-Cubes, page 655)
We obtain the wheel Wn when we add The n-dimensional cube, or n-cube,
denoted by Qn, is the graph that has
an additional vertex to the cycle Cn, for
vertices representing the 2n bit strings
n≥3, and connect this new vertex of the of length n.
n vertices in Cn, by new edges. Two vertices are adjacent if and only if
the bit strings that they represent differ
in exactly one bit position.

4. Bipartite Graphs (⼆分图)

Question:
(1) Definition 5 (page 656)
How to construct the (n+1)-cube Qn+1
from the n-cube Qn (page 655)? A simple graph G is called bipartite if
its vertex set V can be partitioned into
Way:
two disjoint sets V1 and V2 such that
By making two copies of Qn, every edge in the graph connects a
prefacing the labels on the vertices vertex in V1 and a vertex in V2.
with a 0 in one copy of Qn and with a 1
Note: no edge in G connects either two
in the other copy of Qn, and adding
vertices in V1 or two vertices in V2.
edges connecting two vertices that
have labels different only in the first bit,
(2) Example 9 (page 656) (3) Example 10 (page 656)
C6 is bipartite, as shown in Figure 7 K3 is not a bipartite.
(page 656)

V1 = {v1, v3, v5}

V2 = {v2, v4, v6}

(4) Example 11 (page 656) (5) Theorem 4 (page 657)

Are the graphs G and H displayed in A simple graph is bipartite if and only if it
Figure 8 bipartite? is possible to assign one of two colours
to each vertex of the graph so that no
two adjacent vertices are assigned to the
same colour.

Example 12: Use Theorem to determine

whether the graphs in Example 11 are
G:two disjoint sets {a, b, d} and {c, e, f, g} bipartite.
H: not bipartite (consider a,b,f)
 (5) Example 13 (Complete Bipartite
Graphs, page 658)
The complete bipartite graph Km,n is
Another useful criterion for determining
the graph that has its vertex set
whether a graph is bipartite is based on
partitioned into two subsets of m and n
the notion of a path. A graph is bipartite if
vertices, respectively. There is an edge
and only if it is not possible to start at a
between two vertices if and only if one
vertex and return to this vertex by
vertex is in the first subset and the
traversing an odd number of distinct
other vertex is in the second subset.
edges.

Bipartite graphs can be used to model

many types of applications that involve
matching the elements of one set to
elements of another.
 5. New Graphs from Old
(1) Definition 7 (page 663)
A subgraph (⼦图) of a graph G=(V, E) is a
graph H=(W, F) where W⊆
⊆V and F⊆⊆ E.

A subgraph H of G is a proper subgraph

(真⼦图) of G if H ≠ G.

(2) Definition 9 (page 664) (3) Example 19 (page 664)

The union of two simple graphs G1= Find the union of the graphs G1 and
(V1, E1) and G2=(V2, E2) is the simple G2
graph with vertex set V1∪∪V2 and edge
set E1∪∪E2.
The union of G1 and G2 is denoted by
G1∪∪G2.