GATE CSE
First time here? Checkout the FAQ!
x

graph [closed]

0 votes
45 views
Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is_______________.
closed as a duplicate of: GATE2015-1_54
asked in Graph Theory by Junior (685 points)  
closed by | 45 views

1 Answer

0 votes

#edges <= 24.

by euler's formula, 

# regions/faces = e-v+2

$\sum deg(r) = 2\left | edges \right |$

if the no.of edges in the face is 3, then total no.of edges will be = $3\left | r \right |$

$\sum deg(r) \geq  3\left | r \right |$

$2\left | e \right | \geq  3\left | r \right | $

on substituting euler's formula for r,

$2\left | e \right | \geq  3\left ( e-v+2 \right )$

$e \leq 3V-6$

Substitute the given data in the above formula.

we get

$e \leq 24$

 

 

 

answered by Active (1.2k points)  

Related questions

0 votes
1 answer
1
+1 vote
1 answer
2
asked in Graph Theory by rahul sharma 5 Loyal (4.9k points)   | 60 views


Top Users Jun 2017
  1. Bikram

    3704 Points

  2. Hemant Parihar

    1484 Points

  3. junaid ahmad

    1432 Points

  4. Arnab Bhadra

    1408 Points

  5. Niraj Singh 2

    1311 Points

  6. Rupendra Choudhary

    1194 Points

  7. rahul sharma 5

    1120 Points

  8. Arjun

    930 Points

  9. srestha

    928 Points

  10. Debashish Deka

    896 Points

Monthly Topper: Rs. 500 gift card
Top Users 2017 Jun 19 - 25
  1. Bikram

    1960 Points

  2. Niraj Singh 2

    1306 Points

  3. junaid ahmad

    502 Points

  4. sudsho

    410 Points

  5. akankshadewangan24

    388 Points


23,355 questions
30,065 answers
67,365 comments
28,382 users