Discrete Mathematics with Graph Theory (3rd Edition) 310

Discrete Mathematics with Graph Theory (3rd Edition) 310 -...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
308 (b) Since the chain ends UU, the given G-fragments arise from any of 4!/3! = 4 chains. The U,C-fragments arise from any of 4! = 24 chains. The better estimate is 4. The abnormal fragment is UU; this ends the chain. We can find two Eulerian trails ending in UU, beginning at G. There are two answers: GUCGGGUU and GGGUCGUU. (c) The chain ends with GAAAGAA, so the given G-fragments arise from any of 4! = 24 chains while the U,C-fragments arise from any of 5!/3! = 20 chains. The better estimate is 20. There is one Eulerian trail ending at AA, and it begins at C. The only possible chain is CCGGUCACGAAAGAA. (d) The G-fragments arise from any of 4! = 24 possible chains. Observing that the chain ends G, the U,C-fragments could have come from one of 6!/(2!2!) = 180 chains. The better estimate is 24 chains. There is one Eulerian trail ending at G, and it begins at C. The only possible chain is CUAGUUCGGACG. (e) [BB] Since the chain ends CC, the G-fragments arise
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 11/08/2010 for the course MATH discrete m taught by Professor Any during the Summer '10 term at FSU.

Ask a homework question - tutors are online