Math Is Fun Forum
You are not logged in.
- Topics: Active | Unanswered
Pages: 1
#1 Re: Help Me ! » Graph Theory: spanning tree, degree of consistency, trees » 2010-12-06 21:49:17
(3)
Hi;
The third example I can think of that. What do you think? Thx 
#2 Help Me ! » Graph Theory: spanning tree, degree of consistency, trees » 2010-12-06 21:18:46
- aloha
- Replies: 2
Hi;
I've got a couple of examples, I came across, but I can not solve. Could you help me somehow? Thanks
(1) It can be any finite sequence of zeros and ones of a code tree root? Justify its decision.
(2) Can you draw a 2-connected graph on the fewest number of vertices and maximum degree of two vertices
two of them, adding only that there will be no 3-edge connected graph?
(3) Draw a 2-connected graph on the fewest number of vertices, so that it was adding a single edge
3-connected graph.
...Excuse my English
#3 Re: Help Me ! » Combinatorics - Math :) » 2010-12-05 20:46:33
Hi bobbym;
Thank you a lot!!
#4 Re: Help Me ! » Graph theory - Math » 2010-12-05 20:38:20
Thank you for your help
Then I will resolve the last example ....Anybody solve it please? Thanks a lot
B) How many ways there is a traveling salesman in the complete graph minus one edge? (We denote such a graph Kn-xy, where xy is any strongly selected edge of a complete graph.)
#5 Help Me ! » Graph theory - Math » 2010-12-05 09:35:22
- aloha
- Replies: 2
Hi, I need to solve this math problem. I'm in serious troubles 
, so I want to ask, that some body can't help me. Thx a lot!
Graph theory
Business travelers will have the task to visit all the cities in the region (all the vertices of the graph) exactly once and return back.
* A) How many ways there is a traveling salesman in the complete graph Kn?
* B) How many ways there is a traveling salesman in the complete graph minus one edge? (We denote such a graph Kn-xy, where xy is any strongly selected edge of a complete graph.)
Notes: There are the order of visited cities, and starting city! For example, the graph K3, there are 6 such different paths.
....Excuse my English
#6 Re: Help Me ! » Combinatorics - Math :) » 2010-12-04 21:57:46
Hi bobbym;
May I ask why it works infinity? Could you please bring something more? Thanks
#7 Re: Help Me ! » Combinatorics - Math :) » 2010-12-04 00:13:02
bobbym, soroban, DrSteve: thank you very much
#8 Re: Help Me ! » Combinatorics - Math :) » 2010-12-03 21:32:41
so once again an example c) :
What is the maximum average value of eyes one can get with a single roll, which can be reached considering proper construction of the die?
#9 Re: Help Me ! » Combinatorics - Math :) » 2010-12-03 08:47:27
The biggest average value is due out 4 and 3/4.... 4.75 really!! and could you show me how you came to this result? Using a formula or what? Thanks a lot
.....excuse my English
#10 Re: Help Me ! » Combinatorics - Math :) » 2010-12-03 08:05:56
Hi bobbym
I would like to formulate my question better, but my English is very bad! I am using Google Translate 
My question on this part of the example:
c) What is the biggest average value of dots in one throw, which we can get at the appropriate constructions?
.....excuse my English
#11 Re: Help Me ! » Combinatorics - Math :) » 2010-12-03 07:21:23
Thank you for your help
Then I will resolve the last example c) ....Anybody solve it please? Thanks a lot
#12 Re: Help Me ! » Combinatorics - Math :) » 2010-12-03 02:00:02
Great
but it has not calculated the one?? I really have not found any competent mathematician? Thanks
#13 Help Me ! » Combinatorics - Math :) » 2010-12-02 23:55:11
- aloha
- Replies: 21
Hi, I need to solve this math problem. I'm in serious troubles , so I want to ask, that some body can't help me. Thx a lot!
We have dishonest six-sided cube. We know that number 6 drop three times more than number 1, number 5 drops two times more that number 2 and number 4 has same drop like number 3.
a) How many cubes like that exist? Describe, how they look like. (probability of each side)
b) What is the average value of dots in one throw. (result isn't number, but expression)
c) What is the biggest average value of dots in one throw, which we can get at the appropriate constructions?
.....excuse my English
Pages: 1