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

If G = (V, E) is an undirected graph, a spanning subgraph H of G in which each vertex has degree 1 is called a one-factor (or perfect matching) for G.
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

1 Expert Approved Answer
Step: 1 Unlock

a A onefactor for a graph G VE consists of edges winch have no common v... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Document Format (1 attachment)

Word file Icon

954-M-L-A-L-S (8351).docx

120 KBs Word File

Students Have Also Explored These Related Linear Algebra Questions!