The Counting of Isomorphism Classes of Mixed Graphs
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.
Authors
- Songwang Cai (ORCID: https://orcid.org/0000-0001-7393-1242)
- H. Feng (ORCID: https://orcid.org/0000-0001-5510-6169)
- Y. H. Zheng (ORCID: https://orcid.org/0009-0002-8460-0283)
Publication Details
- Journal
- Science and Technology of Engineering Chemistry and Environmental Protection
- Published
- 2025-02-26
- DOI
- https://doi.org/10.61173/bgv0mn30
- Primary Topic
- Advanced Graph Theory Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00