If a planar graph has 11 vertices and four times as many edges as faces, how many faces does it have? Is there a planar graph with 13 vertices that has three times more edges than faces?

C++ for Engineers and Scientists
4th Edition
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Bronson, Gary J.
Chapter4: Selection Structures
Section: Chapter Questions
Problem 14PP
icon
Related questions
Question
**Question:**
- If a graph is planar and has \( n \) vertices, can it have two vertices of degree \( n-1 \)? Can it have three vertices of degree \( n-1 \)? Justify your answer.
Transcribed Image Text:**Question:** - If a graph is planar and has \( n \) vertices, can it have two vertices of degree \( n-1 \)? Can it have three vertices of degree \( n-1 \)? Justify your answer.
**Question:**
If a planar graph has 11 vertices and four times as many edges as faces, how many faces does it have? Is there a planar graph with 13 vertices that has three times more edges than faces?

**Explanation:**
This question involves understanding the properties of planar graphs and using the Euler's formula for planar graphs, which is:

\[ V - E + F = 2 \]

where \( V \) represents the number of vertices, \( E \) represents the number of edges, and \( F \) represents the number of faces.

For the first part:
- Given: \( V = 11 \) and \( E = 4F \).

For the second part:
- Given: \( V = 13 \) and \( E = 3F \).
Transcribed Image Text:**Question:** If a planar graph has 11 vertices and four times as many edges as faces, how many faces does it have? Is there a planar graph with 13 vertices that has three times more edges than faces? **Explanation:** This question involves understanding the properties of planar graphs and using the Euler's formula for planar graphs, which is: \[ V - E + F = 2 \] where \( V \) represents the number of vertices, \( E \) represents the number of edges, and \( F \) represents the number of faces. For the first part: - Given: \( V = 11 \) and \( E = 4F \). For the second part: - Given: \( V = 13 \) and \( E = 3F \).
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Strongly connected components
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
C++ for Engineers and Scientists
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr