Explore BrainMass

Explore BrainMass

    Graph theory

    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!

    Show that it is impossible for an odd number of people in a group to each know exactly 2k+1 other people in the group for any integer k.

    © BrainMass Inc. brainmass.com March 4, 2021, 5:50 pm ad1c9bdddf
    https://brainmass.com/math/graphs-and-functions/graph-theory-13861

    Solution Preview

    Let r be the number of people in the group. Construct a graph G on r vertices representing the r ...

    Solution Summary

    This is a proof regarding odd numbers of people in a group.

    $2.49

    ADVERTISEMENT