You are not logged in.
Pages: 1
Hello
I came across these graph theory questions from my course book, and had trouble understanding them. Any help would be greatly appreciated.
1. Given a graph that is k-regular, prove that G must have a path of at least k
2. If every vertex in a graph G has degree at least two, prove that G has a cycle
thanks
Thanks for your responses, it was greatly appreciated.
Hi
I came across these two binary recursion questions in one of my course notes and had trouble understanding how to solve them. Any help would be appreciated:
1. Let C be the set of strings defined by:
(a) {abc, ccbb} contained in C and
(b) for each x in C, xa, xac, xbc in C
Define a recursive sequence (c_n) that gives the number of strings in C of length n. Start with n=0.
2. Let B be the set of binary strings defined by:
(a) {1} contained in B and
(b) for each x in the set B, x01, x001 in the set B
Show B=C where C is the set of all binary strings that have no 2 consecutive 1's and no 3 consecutive 0's, and start and end with 1.
thanks!
Thanks a lot! I haven't heard of the Binet Formula though.
Hi
I have a questions that I am having trouble solving, any help?
1. Show the Fibonacci Sequence
thanks
Hi
I have this question from Discrete Math class, which has been bugging me for sometime now.
Q: A group of 4 people from different parts of the world decide to swap their homes with each for a week so they can all travel. What is the number of way this can be done?
Thanks
Pages: 1