ABSTRACT
In this chapter we give a brief introduction to certain basic concepts and results in graph theory and algorithms, some of which are not explicitly defined in the remaining chapters of this book. For easy reference we also provide a list of commonly used symbols for graph parameters and concepts. For basic concepts in graphs, digraphs, and algorithms we refer to Bondy and Murty [1], Chartrand and Lesniak [2], Swamy and Thulasiraman [3], Thulasiraman and Swamy [4], and West [5].
