Graph Theory Spring 2005

Soohyuck Chung, Szekit Ka, Joshua Taylor, Benjamin Wiegner

Project

• Project Description

Special Trees

• Our special trees are defined as those

  ...obtained from k copies of paths of length t, by making one end of every path adjacent to an additional vertex z. thus the input to the program is comprised of two integers: k and t.

Code

• enumeration.lisp Current Lisp code for labeling of special trees, and enumeration of special, and general trees. It runs under Lispworks (Free personal edition available), and under Clisp (available on the RPI CS machines). Currently depends on the executables dretog and labelg, which are distributed as part of the nauty, and must be in a location specified in the environment variable $PATH. If you don't have these executables on your path, and you're running on a FreeBSD CS machine, you can start emacs or Clisp with the commands:

  PATH=${PATH}:~tayloj/nauty22 emacs enumeration.lisp PATH=${PATH}:~tayloj/nauty22 clisp

  which will make sure you have access to the (FreeBSD) binaries you need.

Documentation and Reports

• Writeup (PDF, HTML)