Explore BrainMass

Explore BrainMass

    Discrete math - graphs and relations

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

    Question for 8.1:

    Let G be a simple graph. Show that the relation R on the set of vertices of G such that uRv if and only if there is an edge associated to {u,v} is a symmetric, irreflexive relation on G.

    Question for 8.2:

    Show that a simple graph with at least two vertices there must be 2 vertices that have the same degree.

    (see attached for more: 52, 48, 16, 51, 29)

    © BrainMass Inc. brainmass.com October 9, 2019, 11:20 pm ad1c9bdddf


    Solution Summary

    This provides examples of a few different topics, including simple graphs, Hamilton circuits, bipartite graph, relations, and binary trees.