Recent content by hyderman

hello any pone have any idea how to solve this question thanx Prove that the n-cube is connected, for n ≥ 1. (Hint: build the n-cube using two copies of (n − 1)-cube and use induction on n.)

please help me with this question Show that in every simple graph there is a path from any vertex of odd degree to some other vertex of odd degree? here is my answer please check and correct if its wrong thanx ANSWER: In a simple graph, the sum of the degrees of the vertices must...

isomorphic: Two graphs are isomorphic if there is a one-to-one correspondence between their vertices and there is an edge between two vertices of one graph if and only if there is an edge between the two corresponding vertices in the other graph. G: a-5 degrees b-5 . . h- 5...

Isomorphic means same shaped,,,,,,,, now i need explanation i tried to follow some examples with no luck

okey that's what i have but i still need some one to explain that in steps For G this graph is made of a 3-cycle agc, a 4-cycle hdbf. For H this graph is made of a 7-cycle 2583647. C so G and H are not isomorphic i am not sure if this iright or wrong and the same time i need some...

hello thanx i know about the dgrees but i still don't know how to determine that somtime the degree fo the vertices does tell you a bout that... so i know step by step details in order to know all possiblities... i appreciate your help thanx

please help by explainig in steps thanks much Determine if G and H are isomorphic. Justify your answer http://img252.imageshack.us/img252/9076/25461570nc6.jpg

i have the images in this file please click and see thanx http://download.yousendit.com/B7955B3525D78CEB

hello how can i determine if the graph isomorphic is there is steps to do that thanx

a) we have property starts with 0,1,2.3.4 so there are n-1 digits of sequence sio i think the recurrence should be 0+(an-1)^3times therefore 3an-1 + 5 b) initial condition a0=1 and a1=1 c) 3n-1+ 5n-1 + an-1 please i just need some one to explain this in steps ... this type of...

hello any one can help me with this question thanx (a) Find a recurrence relation for the number of n-digit sequences over the alphabet {0, 1, 2, 3, 4} with at least one 1 and the first 1 occurring before the first 0 (possibly no 0’s). (b) What are the initial conditions? (c)...

hello please check my answer and let me know if there are any errors and if there are better ways to solve ... Solve the recurrence relation an = an−1 + 20an−2 with a0 = −1 and a1 = 13. Step – I : Find Characteristic equation and solve for its roots: an = an−1 +...

okey can you tell me ur opinion on this thanx Assume that the graph has n vertices. Each of those vertices is connected to either 0, 1, 2, ..., n−1 other vertices. If any of the vertices is connected to n−1 vertices, then it is connected to all the others, so there cannot be a vertex...

please explain more in details

thanx for replyng i did draw a graph but i still can't understand the whole question i know that Each vertices is connected to either 0, 1, 2, ..., n−1 other vertices but i cannot get the whole idea please help i