# circulant matrix

(redirected from Circulant graph)

## circulant matrix

[′sər·kyə·lənt ′mā‚triks]
(mathematics)
A matrix in which the elements of each row are those of the previous row moved one place to the right.
References in periodicals archive ?
A circulant graph X = Circ(n; L) is a graph with vertex set V(X) = {[u.
Determining the diameter of a circulant graph (or any graph for that matter) is a difficult problem.
Whereas the total vertexirregularity strength of cubic graphs, wheel related graphs,Jahangir graph Jn,2 for n = 4 and circulant graph Cn(1, 2) for n = 5 has been determined by Ahmad et al.
n](1, h) to be the circulant graph with vertex set [Z.
n](a, b), the latter being the circulant graph Cay([Z.
Keywords: Feedback Vertex Set, Distance graph, Circulant graph.
The circulant graph can be defined as follows: let n be a natural number and let D = {[d.
The last, and longest, chapter introduces the basic concepts of algebraic graph theory, the prime number theorem for graphs, and the spectral properties of integral circulant graphs.
Distance graphs generalize the very well-studied class of circulant graphs [2, 16, 17, 26].
Hamiltonian decomposition of recursive circulant graphs.
It is necessary for circulant graphs to be connected [2].
Optimal algorithms for the 2-terminal routing problem have been found, for instance, in 2-jump circulant graphs Robic and Zerovnik (2000) and hexagonal networks Nocetti et al.
Site: Follow: Share:
Open / Close