Scribd
Upload
16 views

Module 6 - Graphs and Trees

The document discusses learning activities involving graphs and graph theory concepts like bipartite graphs, isomorphic graphs, matchings in bipartite graphs, and graph coloring. It provides examples and explanations for determining properties of various graphs.

Uploaded by

Khristel May Rañon
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
16 views

Module 6 - Graphs and Trees

The document discusses learning activities involving graphs and graph theory concepts like bipartite graphs, isomorphic graphs, matchings in bipartite graphs, and graph coloring. It provides examples and explanations for determining properties of various graphs.

Uploaded by

Khristel May Rañon
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

VI.

Learning Activities: 
1. Which of the graphs below are bipartite? Justify your answers. 

Three graphs are bipartite.  The graph that is not a bipartite is C7

2. Is it possible for two different (non-isomorphic) graphs to have the same number of vertices and the
same number of edges? What if the degrees of the vertices in the two graphs are the same (so both
graphs have vertices with degrees 1, 2, 2, 3, and 4, for example)? Draw two such graphs or explain
why not. 
Yes. For example, both graphs below contain 6 vertices, 7 edges, and have degrees
(2,2,2,2,3,3)

 
3. Are the two graphs below equal? Are they isomorphic? If they are isomorphic, give the
isomorphism. If not, explain. 
Graph 1: V={a,b,c,d,e},V={a,b,c,d,e}, E={{a,b},{a,c},{a,e},{b,d},{b,e},{c,d}}. 
Graph 2: 

 
 The graphs are not equal. For example, graph 1 has an edge {a,b}{a,b} but graph 2 does
not have that edge. They are isomorphic. One possible isomorphism
is f:G1→G2f:G1→G2 defined
by f(a)=d,f(a)=d, f(b)=c,f(b)=c, f(c)=e,f(c)=e, f(d)=b,f(d)=b, f(e)=a.

4. Find a matching of the bipartite graphs below or explain why no matching


exists. 
 

 
The first and third graphs have a matching, but the middle graph does not.

5. What is the smallest number of colors that can be used to color the vertices of a
cube so that no two adjacent vertices are colored identically? 

The chromatic number of the graph is 2, because the graph is bipartite.

You might also like