Let the decay number, sigma(G) be the minimum number of components of a cotree of a connected graph G. Let Omega be the collection of all 3-connected diameter 3 graphs. In this paper, we prove that if k is the minimum number such that q greater than or equal to 2p-k for each (p, q) - graph G is an element of Omega, and l is the minimum number such that sigma(H) less than or equal to l-1 for each graph H is an element of Omega, then k = l. Furthermore, we prove that k less than or equal to 11 and we find a 3-connected, diameter 3 graph with q = 2p-8. So we have that 8 less than or equal to k less than or equal to 11 and we conjecture that k = 8.
