Let 1 s1<s2< · · ·<sk n/2 be given integers. An undirected even-valent circulant graph, C12k n , has n vertices 0, 1, 2, . . ., n− 1, and for each si (1 i k) and j (0 j n− 1) there is an edge between j and j + si (mod n). Let T (C12k n ) stand for the number of spanning trees of C12k n . For this special class of graphs, a general and most recent result, which is obtained in [Y.P. Zhang, X.Yong...

We explore ways to concisely describe circulant graphs, highly symmetric graphs with properties that are easier to generalize than other graphs. We introduce connection sets as a way to describe isomorphism among some circulant graphs and discuss Ádám’s conjecture that attempts to generalize this idea to all circulant graphs, exploring cases in which the conjecture holds and cases in which it f...

Abstract: In this paper, we consider the skew circulant and skew left circulant matrices with the Fibonacci and Lucas numbers. Firstly, we discuss the invertibility of the skew circulant matrix and present the determinant and the inverse matrix by constructing the transformation matrices. Furthermore, the invertibility of the skew left circulant matrices are also discussed. We obtain the determ...

Configurations are necklaces with prescribed numbers of red and black beads. Among all possible configurations, the regular one plays an important role in many applications. In this paper, several aspects of regular configurations are discussed, including construction, uniqueness, symmetry group and the link with balanced words. Another model of configurations is the polygons formed by a given ...

Edge-coloring total k-labeling of a connected graph G is an assignment f of non negative integers to the vertices and edges of G such that two adjacent edges e = uv and e = uv of G have different weights. The weight of an edge uv is defined by: w(e = uv) = f(u) + f(v) + f(e). In this paper, we study the chromatic number of the edge coloring by total labeling of 4-regular circulant graphs Cn(1, k).

Let T (G) be the number of spanning trees in graph G. In this note we explore the asymptotics of T (G) for circulant graphs. The circulant graph Cs1,s2,···,sk n is the 2k regular graph with n vertices labelled 0, 1, 2, · · · , n − 1, where node i has the 2k neighbors, (0 ≤ i ≤ n − 1) adjacent to vertices i + s1, i + s2, · · · , i + sk mod n. In this note we give a closed formula for the asympto...

Let T (G) be the number of spanning trees in graph G. In this note we explore the asymptotics of T (G) for circulant graphs. The circulant graph Cs1,s2,···,sk n is the 2k regular graph with n vertices labelled 0, 1, 2, · · · , n − 1, where node i has the 2k neighbors, (0 ≤ i ≤ n − 1) adjacent to vertices i + s1, i + s2, · · · , i + sk mod n. In this note we give a closed formula for the asympto...