Learn More
Let the decay number, /spl zeta/(G) be the minimum number of components of a cotree of a connected graph G. Let /spl 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 /spl ges/ 2p - k for each (p,q)-graph G /spl epsi/ /spl Omega/, and 1 is the minimum number such that /spl(More)
  • 1