Finding Tricyclic Graphs with a Maximal Number of Matchings -- Another Example of Computer Aided Research in Graph Theory

Ivan Gutman, Dragoš Cvetkoić

Tricyclic graphs on n vertices with maximal number of matchings are determined by a computer search for small values of $n$ and by an induction argument for the rest. The computer search is performed by the interactive programming system ``GRAPH", implemented at the University of Belgrade, and represents a typical example of the usage of this system in scientific research.