Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics

2018/12/10 by Mednykh, Alexander, Mednykh, Ilya · 1 citation
#05C30 #39A10 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1812.04484

Abstract

In the present paper, we investigate a family of circulant graphs with non-fixed jumps G_n=C_βn(s₁, …,s_k,α₁n,…,α_ℓ n), 1≤ s₁

Cited by

• The number of rooted spanning forests of bicirculant graphs

Related

• Complexity of the circulant foliation over a graph
• On the classification and dispersability of circulant graphs with two jump lengths
• Circulants and their connectivities
• Permanents of Circulants: a Transfer Matrix Approach (Expanded Version)
• Asymptotic Automorphism Groups of Circulant Graphs and Digraphs