Explore BrainMass

Explore BrainMass

    Proofs: K-Regular Graphs

    Not what you're looking for? Search our solutions OR ask your own Custom question.

    This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

    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.

    © BrainMass Inc. brainmass.com March 6, 2023, 12:44 pm ad1c9bdddf

    Solution Preview

    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.The positive integer and functions are examined.