The Counting of Isomorphism Classes of Mixed Graphs

Abstract

Group theory and graph theory have important research value in mathematics today. Counting problems also play a decisive role in combinatorics. This paper introduces the number of isomorphism classes of mixed graphs with n vertices. The counting of them which using Burnside’s lemma is solved by converting the cases of edges and vertices to some colors.