Question: If G = (V, E) is an undirected graph, a spanning subgraph H of G in which each vertex has degree 1 is called a
a) If G has a one-factor, prove that |V| is even.
b) Does the Petersen graph have a one-factor? (The Petersen graph was first introduced in Example 11.19.)
c) In Fig. 13.31 we find the graph K4 in part (a), while part (b) provides the three possible one-factors for K4. How many one-factors are there for the graph K6?
d) For n ∈ Z+, let an count the number of one-factors that exist for the graph K2n. Find and solve a recurrence relation for an.
Step by Step Solution
3.53 Rating (156 Votes )
There are 3 Steps involved in it
a A onefactor for a graph G VE consists of edges winch have no common v... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
954-M-L-A-L-S (8351).docx
120 KBs Word File
