Enumeration of dicirculant digraphs
Journal of Algebraic Combinatorics · 2026-05 · 63 (3)
DOI: 10.1007/s10801-026-01503-0 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Algebraic Combinatorics, online erschienen am 02.05.2026. Verfasst von Jing Wang und 2 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 31 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Guangdong Basic and Applied Basic Research Foundation.
Abstract (Originalsprache)
Let T4p=⟨a,b∣a2p=1,ap=b2,b-1ab=a-1⟩\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$T_{4p}=\langle a,b\mid a^{2p}=1,a^p=b^2, b^{-1}ab=a^{-1}\rangle $$\end{document} be the dicyclic group of order 4p. A Cayley digraph over T4p\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$T_{4p}$$\end{document} is called a dicirculant digraph. In this paper, we calculate the number of (connected) dicirculant digraphs of order 4p (p prime) up to isomorphism by using the Pólya Enumeration Theorem. Moreover, we get the number of (connected) dicirculant digraphs of order 4p (p prime) and out-degree k for every k.
Förderung
- National Natural Science Foundation of China
- Guangdong Basic and Applied Basic Research Foundation
Zitieren
APA
Wang, J., Wang, L., & Liu, X. (2026). Enumeration of dicirculant digraphs. Journal of Algebraic Combinatorics, 63(3). https://doi.org/10.1007/s10801-026-01503-0
Vancouver
Wang J, Wang L, Liu X. Enumeration of dicirculant digraphs. Journal of Algebraic Combinatorics. 2026;63(3). doi:10.1007/s10801-026-01503-0
BibTeX
@article{Wang2026,
author = {Wang, Jing and Wang, Ligong and Liu, Xiaogang},
title = {Enumeration of dicirculant digraphs},
journal = {Journal of Algebraic Combinatorics},
year = {2026},
volume = {63},
number = {3},
doi = {10.1007/s10801-026-01503-0}
}
EUVIMED