作者pabeni (真儿)
看板Grad-ProbAsk
标题Re: [问题] 离散-planer
时间Tue Mar 24 21:33:23 2009
※ 引述《nana0130 (小那)》之铭言：
: If a planar connected graph G has 5 region of degree 4,
: 11 region of degree 5, 2 regions of degree 7,
: 2 regionsof degree 8, and 1 region of degree 9, then G has ______
: edges and ______ vertices.
一个边可以决定两个region
=> 5*4 + 11*5 + 2*7 + 2*8 + 1*9 = 114 = 2*(edge数)
=> edge数 = 57 ###
=> Eular's plan Theorem V-E+R=2
=> V-E+R = V - 57 + (5+11+2+2+1)
=> vertices数 = 38 ###
--
※ 发信站: 批踢踢实业坊(ptt.cc)
◆ From: 61.217.106.226
1F：推 nana0130:啊 ！谢谢你 03/25 00:41