Now showing items 1-3 of 3

    • Building fences around the chromatic coefficients. 

      Strickland, Debra Ann Mullins. (1997)
      Although these bounding conditions do not allow us to completely predict all chromatic polynomials, they do serve to severely limit the form of polynomials considered to be candidates for the chromatic polynomial of some graph.
    • Constructing graphs to meet specified conditions: A generalizability study. 

      Braddy, Linda Sue. (2000)
      This study investigated differences in problems involving graphical representations of functions. Specifically, problems requiring students to answer questions about a given graph were compared with problems requiring ...
    • Graph models and system diagnosis. 

      Lamb, Chad Calvin. (1997)
      The connectivity of a system is an important measure of fault tolerance. Typical interconnection networks are sparse and symmetrical. The classical diagnosis theories, such as t-diagnosability, are not appropriate for these ...