.
. centre de ressources dilemmes et doutes le visage humain de mathématiques Qui sommes-nous Problème de mois activités de promotion babillard
Centrale des maths - centraledesmaths.uregina.ca
Dilemmes & doutes
« D & D »
. .
topic card  

Sujet:

circuit

liste de
sujets
. .
nouvelle recherche

2 articles trouvés pour ce sujet.
 
Page
1/1
A hamiltonian circuit 2006-07-24
Tom pose la question :

1)Prove that every simple not directed graph with 21 vertices and 208 edges has
a hamiltonian circuit but not an Euler circuit.

(I have proved that if we give the 2 edges for each vertices then after a few
steps I have 21 vertices of odd degree and 19 edges.So in the end I have 2
vertices of odd degree.So I have not an Euler circuit.But how can I prove that
there is a Hamiltonian one?)

2)If G is a tree and has a virtex k degree,prove that it also has at least k
vertices degree 1.


Penny Nom lui répond.
The two-digit numbers from 10-99 1998-01-21
Alexis Riddle pose la question :
My name is Alexis. I'm a student in 8th grade and I'm taking Algebra I Honors. My question is: In a string of numbers, two adjacent digits are considered as a two-digit number. For instance, the string 11012 contains the numbers 10, 11, and 12. What is the number of digits in the smallest string that contains all of the two-digit numbers from 10-99? Please help and thank you for any assistance you can give me.
Penny Nom lui répond.
 
Page
1/1

 

 


Centrale des maths reçoit une aide financière de l’Université de Regina et de The Pacific Institute for the Mathematical Sciences.

CMS
.

 

accueil centre de ressources accueil Société mathématique du Canada l'Université de Regina PIMS