Automorphism Groups of Circulant Digraphs With Applications to Semigroup Theory
Sign Up to like & getrecommendations! Published in 2018 at "Combinatorica"
DOI: 10.1007/s00493-016-3403-0
Abstract: We characterize the automorphism groups of circulant digraphs whose connection sets are relatively small, and of unit circulant digraphs. For each class, we either explicitly determine the automorphism group or we show that the graph… read more here.
Keywords: groups circulant; digraphs applications; circulant digraphs; applications semigroup ... See more keywords
Circulant Digraphs with Larger Linear Guessing Number and Smaller Degree
Sign Up to like & getrecommendations! Published in 2025 at "Mathematics"
DOI: 10.3390/math13132129
Abstract: The guessing number of a digraph is a new invariant in graph theory raised by S. Riis in 2006 and based on its applications in network coding and boolean circuit complexity theory. In this paper,… read more here.
Keywords: circulant digraphs; number; guessing number; linear guessing ... See more keywords