Explore BrainMass

Explore BrainMass

    Planar graph

    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!

    I need to show that if G is a planar graph, then G must have a vertex of degree at most 5.

    © BrainMass Inc. brainmass.com March 4, 2021, 5:45 pm ad1c9bdddf

    Solution Preview

    A graph is called a planar graph if it is drawn in such a way that the edges never cross, except at where they meet at vertices.

    Let G be a planar graph with k connected components, n vertices, q edges, and r regions, we have to prove, that the average degree of the vertices is less than 6.

    We have from graph theory,
    deg(v1) + deg(v2) + deg(v3) + ... + deg(vn) = 2q

    where v1, v2, v3, ... vn denote the vertices in G

    Average degree of the vertices is A = (1/n)*2q .....(1)
    but we have from another theorem, q ≤ 3n − 6 ...

    Solution Summary

    This is a proof regarding the degree of a planar graph.