Classification Algorithms For Graphs, Digraphs, and Linear Spaces

This book considres one the main problems in discrete mathematics which is called the classification problem. In such a problem, given a collection of properties, construct up to isomorphism all structures that satisfy them. In otherwords, the classification problem is the problem of determining complete systems of representatives of the isomorphism classes. Also, this book considers both the use of invariants and the use of partition backtracking for solving the isomorphism problems of 0,1-matrices, in general. It also discusses the inverse problem of finding all structures for a given invariant. This leads to the composition principle for incidence structures and eventually to some new results. The goal of this book is to be of great help to researchers. Also, it can be used for graduate courses in both mathematics and computer sciences.