Linear mappings which preserve acyclicity properties of graphs and digraphs and applications to matrices

AbstractWe characterize linear mappings which map the set of all graphs (digraphs) with n vertices which contain no circuit (directed circuit) of length greater than or equal to k into or onto itself. We apply these results to characterize linear transformations on n × n matrices which preserve the above properties of the graph or the diagraph of the matrix