GATE CSE
First time here? Checkout the FAQ!
x

graph [closed]

0 votes
44 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 | 44 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

+1 vote
1 answer
1
asked ago in Graph Theory by Debashish Deka Veteran (46.9k points)   | 89 views


Top Users May 2017
  1. akash.dinkar12

    3154 Points

  2. pawan kumarln

    1636 Points

  3. sh!va

    1590 Points

  4. Arjun

    1350 Points

  5. Bikram

    1298 Points

  6. Devshree Dubey

    1246 Points

  7. Angkit

    1044 Points

  8. Debashish Deka

    1042 Points

  9. LeenSharma

    880 Points

  10. srestha

    706 Points

Monthly Topper: Rs. 500 gift card
Top Users 2017 May 22 - 28
  1. Bikram

    384 Points

  2. pawan kumarln

    262 Points

  3. Ahwan

    236 Points

  4. Arnab Bhadra

    136 Points

  5. LeenSharma

    118 Points


22,770 questions
29,090 answers
65,119 comments
27,635 users