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
2 answers
1
asked in Graph Theory by Vicky rix Loyal (2.8k points)   | 62 views
0 votes
3 answers
3


Top Users Apr 2017
  1. akash.dinkar12

    3508 Points

  2. Divya Bharti

    2542 Points

  3. Deepthi_ts

    2040 Points

  4. rude

    1966 Points

  5. Tesla!

    1768 Points

  6. Shubham Sharma 2

    1610 Points

  7. Debashish Deka

    1588 Points

  8. Arunav Khare

    1454 Points

  9. Kapil

    1424 Points

  10. Arjun

    1420 Points

Monthly Topper: Rs. 500 gift card

22,076 questions
28,040 answers
63,230 comments
24,135 users