[理工] 離散 圖論

看板Grad-ProbAsk作者 (Ou )時間13年前 (2012/12/06 23:13), 編輯推噓1(101)
留言2則, 2人參與, 最新討論串1/16 (看更多)
Q1.What is the minimum number of vertices a simple graph can have if the graph has 100 edges? Q2.Suppose G is an arbitrary digraph with n vertices.What is the largest possible number of distinct subgraphs with k vertices that G may have? (Treat isomorphic subgraphs as distinct.Choose G to maximize this number) Q3.Which of the following graphs is not regular?Suppose n is an integer>1 Qn(a n-dimensional hypercube) Ans3:n regular ....不懂題目意思,還有它的答案 因為是商學院跨考自己讀,所以滿多不懂的,請大大講解謝謝 -- ※ 發信站: 批踢踢實業坊(ptt.cc) ◆ From: 111.254.171.193

12/06 23:26, , 1F
1.vertex最少就找complete graph, C(n,2)>100的n
12/06 23:26, 1F

12/07 00:07, , 2F
for all vertex v in G , deg(v) = n , 就是n -regular
12/07 00:07, 2F
文章代碼(AID): #1GmBOUgO (Grad-ProbAsk)
討論串 (同標題文章)
文章代碼(AID): #1GmBOUgO (Grad-ProbAsk)