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.

https://brainmass.com/math/graphs-and-functions/planar-graph-proofs-9830

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 &#8804; 3n &#8722; 6 ...

Solution Summary

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

\$2.49
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}