This paper determines the maximum leaf number and the connected domination number of some undirected and connected circulant networks which are optimal among all the maximum leaf numbers and connected domination numbers of circulant networks of the same order n and the same degree 2k. We shall tackle this problem by working on the largest possible number of vertices between two consecutive jump sizes.
Muga, F.P., II. (2014). On the maximum leaf number of a family of circulant graphs. Lecture Notes in Engineering and Computer Science. Volume 1, 2014, Pages 46-49 World Congress on Engineering and Computer Science 2014, WCECS 2014; San Francisco; United States; 22 October 2014 through 24 October 2014; Code 109530.