Petersen''s factor theorem, Advanced Statistics

Suppose the graph G is n-connected, regular of degree n, and has an even number of vertices. Prove that G has a one-factor.

Petersen's 2-factor theorem (Theorem 5.40 in the notes) proves that every regular graph G of even degree has a 2-factor by nding a 1-factor in a regular bipartite graph which is constructed from an Eulerian trail of G. However, the choice of Eulerian trail and 1-factor determines which 2-factor is obtained. Consider the following Eulerian trail C of K7 where V (K7) = {0; 1; 2; 3; 4; 5; 6}.

C : 0; 1; 2; 3; 4; 5; 6; 0; 2; 4; 6; 1; 3; 5; 0; 3; 6; 2; 5; 1; 4; 0:

(a) List a 2-factor of K7 of type [3; 4] that could arise from C via the proof technique of Petersen's theorem, and explain why it could arise.

(b) List a 2-factor of K7 that could not arise from C via the proof technique of Petersen's theorem, and explain why it could not arise.

Posted Date: 3/5/2013 6:57:55 AM | Location : United States







Related Discussions:- Petersen''s factor theorem, Assignment Help, Ask Question on Petersen''s factor theorem, Get Answer, Expert's Help, Petersen''s factor theorem Discussions

Write discussion on Petersen''s factor theorem
Your posts are moderated
Related Questions

facts and statistics about daycare

difference between histogram and historigram

O. J. Simpson paradox is a term coming from the claim made by the defence lawyer in murder trial of O. J. Simpson. The lawyer acknowledged that the statistics demonstrate that onl

It is used generally for the matrix which specifies a statistical model for a set of observations. For instance, in a one-way design with the three observations in one group, tw

Prospective study : The studies in which individuals are followed-up over the period of time. A general example of this type of investigation is where the samples of individuals ar

The Null Hypothesis - H0:  There is autocorrelation The Alternative Hypothesis - H1: There is no autocorrelation Rejection Criteria: Reject H0 (n-s)R 2 > = (1515 - 4) x (0.

a company suppliers specialized, high tensile Pins to customers. It uses an automatic lathe to produce the pins. Due to the factors such as vibration, temperature and wear and tear

Hill-climbing algorithm is  an algorithm which is made in use in those techniques of cluster analysis which seek to find the partition of n individuals into g clusters by optimizin

Procedures for estimating the probability distributions without supposing any particular functional form. Constructing the histogram is perhaps the easiest example of such type of