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

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.

... Note: if a planar graph is embedded in the plane ,then it is called a plane graph. keywords: peterson graph. ... So, the Petersen graph is non-planar. ...

... I would think that each layer would need to be a planar graph designed to exclude K_5 and K_3,3 and not to have too many interconnections between layers. ...

Graphs were produced and calculations performed. In SXR205 Activity B, the kinetics of the reaction between the square-planar platinum complex dichloro-(2,2 ...

... A graph surface $S={(x,y,z):z=f(x,y)}$ is orientable, as the field [frac{1 ... a,b]$, then the curve traced on space (or in the plane if it is a planar curve) as $t ...

... have X axis is PC2 and Y is PC3, again with the figures dotted on the chart. ... Component axes is that the axes can now be used to define planar sections through ...