Share
Explore BrainMass

Proofs: K-Regular Graphs

Prove that
1) If n and k are odd positive integers with k<=n-1, then there are no graphs G such that G is k-regular with order n.
2) If n is even, k is a positive integer such that k<=n-1, then there are k-regular graphs with order n.

Solution Preview

Proof
1) By contradiction. If G is a k-regular graph with order n, then the sum of ...

Solution Summary

Statements involving k-regular graphs are proven.

$2.19