Jump to content

Very Hard

RK4
in Linear Algebra and Group Theory

Featured Replies

(i).

 

Let G be a simple connected cubic plane graph, and let phi_k be the number of

k-sided faces. By counting the number of vertices and edges of G, prove that:

 

3*phi_3 + 2*phi_4 + phi_5 - phi_7 - 2*phi_8 - . . . = 12

 

(ii).

 

Deduce that G has at least one face bounded by at most five edges.

  • Author

If G is a simple connected planar cubic graph then:

 

| f | = 2 + | v |/2

 

I don't get the counting part?

 

Why do we need to count the number of nodes and edges to come up with the number of k-sided faces' sum?

Archived

This topic is now archived and is closed to further replies.

Go to topic listing

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.

Configure browser push notifications
Chrome (Android)
  1. Tap the lock icon next to the address bar.
  2. Tap Permissions → Notifications.
  3. Adjust your preference.
Chrome (Desktop)
  1. Click the padlock icon in the address bar.
  2. Select Site settings.
  3. Find Notifications and adjust your preference.