Symbolic calculus in calculating characteristic and acyclic polynomials of graphs

Abstract

There are many polynomials closely connected with graphs and the theory of graphs. These polynomials are useful both in theory and its application as they enable to determine some properties of graphs and relations among graphs by the methods of algebra. In our contribution we will illustrate the use of symbolic calculus of Matlab software package as an efficient assistant in calculating the characteristic and the acyclic polynomial of various types of graphs.