Scribd
Upload
236 views12 pages

Graph Theory: Types and Exercises

The document discusses various classes of graphs including complete graphs, regular graphs, bipartite graphs, planar graphs, trees, and forests, along with their definitions and examples. It includes exercises for readers to engage with the concepts, such as determining the number of edges in regular graphs and identifying bipartite graphs. Additionally, it presents the main theorem regarding trees and their properties.

Uploaded by

2491178958
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
236 views12 pages

Graph Theory: Types and Exercises

The document discusses various classes of graphs including complete graphs, regular graphs, bipartite graphs, planar graphs, trees, and forests, along with their definitions and examples. It includes exercises for readers to engage with the concepts, such as determining the number of edges in regular graphs and identifying bipartite graphs. Additionally, it presents the main theorem regarding trees and their properties.

Uploaded by

2491178958
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd

GRAPH THEORY

Classes of Graphs
Complete Graphs
• A graph is complete if its vertices are mutually adjacent.
• The complete graph on vertices has edges. This graph is denoted .
• Example: Draw each for .
Regular Graphs
• A graph is -regular if all its vertices have the same degree, .
• Example: is -regular, because each vertex of has degree .

• A cycle consists of a sequence of vertices such that is an edge of and


is an edge of . The cycle having vertices is denoted .
• Example: is -regular.
Regular Graphs: Exercise
• Exercise 1: What is the number of edges in a -regular graph with
vertices?

• Exercise 2: What can you conclude about and in Exercise 1?


Bipartite Graphs
• A graph is bipartite if its vertices can be separated into two sets A and B,
so that vertices within the same set are nonadjacent. Note that the only
adjacencies are between vertices of the set A and vertices of the set B.

• Labeling technique to determine whether G is bipartite:


Label any vertex a. Now, label all vertices adjacent to a with the label b.
Next, label by a every vertex that is adjacent to each vertex just labeled b.
Continue in this manner, labeling vertices adjacent to each vertex just
labeled with the opposite label. Do this for each component.
Bipartite Graphs: Exercise
• Exercise 3: Label each graph in the following figure to determine if it
is bipartite. For those that are bipartite, redraw them showing the
vertex sets A and B of the definition.
Bipartite Graphs: Exercise
• Exercise 3: Draw all different (nonisomorphic) bipartite graphs having
four vertices.
Complete bipartite graph
• A complete bipartite graph is one in which each vertex in set A is
adjacent to every vertex in set B. The complete bipartite graph having
m vertices in A and n vertices in B is denoted .

• Exercise 4: ?
Planar Graphs
• A planar graph is a graph that can be drawn in the plane (that is, on a
flat surface) with no crossing edges.
• Example: Can you draw following graphs with no edges crossing?

• Theorem: is not planar.


Tree and Forest
• A tree is a connected graph that does not contain a cycle as a
subgraph.
• A forest is a graph, all of whose components are trees.
• Example: A path having vertices is denoted . is a tree.
Trees: Main Theorem
Theorem: Suppose is a graph having vertices. Then the following
statements are equivalent:
i. is a tree.
ii. is connected and has edges.
iii. has edges and no cycles.
iv. Any two vertices of are connected by a unique path.
v. contains no cycles, but the addition of any edge to will produce a single
cycle.
Trees: Exercise
• Exercise 5: There exists exactly one path between every pair of
vertices in the graph . This graph has 7 vertices of degree 1, 5 vertices
of degree 2, and vertices of degree 3. Find .

You might also like