This dissertation deals with some basic proper ties of finite graphs having no loops and no parallel lines. In particular it is concerned with properties which help determine when two graphs are isomorphic and when a map ...