Spectral graph theory discusses about the algebraic properties of graphs based on spectrum a graph. This article investigated prism The method used in this research is circulant matrix. results showed that P2,s regular degree 3, for s odd and ≥ circulantt with spectrum.

The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise, quantum walks have shown much potential as a framework for developing new quantum algorithms. Here we present explicit efficient quantum circuits for implementing continuous-time quantum walks on the circulant class of graphs. These circuits allow us to...

In this paper we consider additive circulant graph codes over GF(4) and an algorithm for their construction. Also, we present some new results obtained by

The irregularity strength of a simple graph is the smallest integer k for which there exists a weighting of the edges with positive integers at most k such that all the weighted degrees of the vertices are distinct. In this paper we study the irregularity strength of circulant graphs of degree 4. We find the exact value of the strength for a large family of circulant graphs. © 2005 Elsevier B.V...

The total chromatic number, χ″(G) is the minimum number of colors which need to be assigned obtain a coloring graph G. Total Coloring Conjecture (TCC) made independently by Behzad and Vizing that for any graph, χ″(G)≤Δ(G)+2, where Δ(G) represents maximum degree In this paper we obtained some classes four regular circulant graphs.

Let G be a finite , simple , undirected graph . The graph G is selfcompletementary if G is isomorphic to its complement G # ; in symbols , G . G # . It is well known that a selfcomplementary graph of order n exists if f n ; 0 or 1 (mod 4) . Moreover , a regular selfcomplementary graph of order n exists if f n ; 1 (mod 4) . The objective of this paper is to study selfcomplementary graphs with ev...