Explore BrainMass
Share

Explore BrainMass

    Fully connected graphs

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

    Is it TRUE or FALSE that ( and why )

    In an undirected graph(with no self loops), if every vertex has degree at least n/2, then the graph is fully connected ?

    Thanks

    © BrainMass Inc. brainmass.com October 9, 2019, 4:59 pm ad1c9bdddf
    https://brainmass.com/computer-science/computer-systems-organization/fully-connected-graphs-45266

    Solution Preview

    True.

    For a fully connected graph, every vertex has an edge to every other vertex.
    DIRAC'S Theorem: if G is a simple graph with n vertices with n ≥ 3 ...

    Solution Summary

    Fully connected graph overview

    $2.19