Self-complementary graph proof
Not what you're looking for?
1.10 Let G be a self-complementary graph of order n, where n=1(mod 4)
Prove that G contains at least one vertex of degree (n-1)/2
(hint: Prove the stronger result that G contains an odd number of vertices of degree (n-1)/2.
Can you explain it step by step and draw a graph.
Purchase this Solution
Solution Summary
The solution provides a proof regarding a self-complementary graph.
Solution Preview
Please see the attachment.
In the graph, H is the complement graph of G. G and H are isomorphic, n = 5. G has 5 (odd) vertices with degree (n-1)/2=2. This is an example of the statement. Here is the proof.
Proof:
Suppose G is a self-complementary graph with order n, n = 1 (mod 4). H is its complementary graph. Since G is self-complementary, then G and H are isomorphic. We can find an isomorphic map p from G to H, such that (u,v) is an edge of G if and only if (p(u),p(v)) ...
Purchase this Solution
Free BrainMass Quizzes
Multiplying Complex Numbers
This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.
Probability Quiz
Some questions on probability
Know Your Linear Equations
Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.
Exponential Expressions
In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.
Graphs and Functions
This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.