Waste less time on Facebook — follow Brilliant.
×

Euler Formula for admissible graphs ( like convex polyhedra) !

Edit :- Here, the base case is \( T(1) \) true, where \( v = 2, n = 1 \) and \( f =1 \).

Note by Karthik Venkata
2 years, 5 months ago

No vote yet
1 vote

Comments

Sort by:

Top Newest

@Llewellyn Sterling

Remember that FULL BLACKBOARD thing ? :) Azhaghu Roopesh M · 2 years, 5 months ago

Log in to reply

@Azhaghu Roopesh M Yeah; I remember. xD Llewellyn Sterling · 2 years, 5 months ago

Log in to reply

@Azhaghu Roopesh M What is it ? Karthik Venkata · 2 years, 5 months ago

Log in to reply

@Karthik Venkata See this Azhaghu Roopesh M · 2 years, 5 months ago

Log in to reply

@Azhaghu Roopesh M XD ! Karthik Venkata · 2 years, 5 months ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...