circulant graphs
General Cyclic Orthogonal Double Covers of Finite Regular Circulant Graphs
... of circulant graphs and construct CODC by certain classes of graphs such as complete bipartite graph, the union of the co-cycles graph with a star, the center vertex of which, belongs to the ...
9
Large circulant graphs of fixed diameter and arbitrary degree
... undirected circulant graphs for small degrees and ...known circulant graphs with degree up to 16 and diameter up to ...more graphs to be ...
17
A Study on Isomorphic Properties of Circulant Graphs
... Acknowledgment The author expresses his sincere thanks to Prof. Lowell W Beineke, Indiana-Purdue University, U.S.A., Prof. Brian Alspach, University of Newcastle, Australia, Prof. M.I. Jinnah, Univer- sity of Kerala, ...
6
On Cyclic Orthogonal Double Covers of Circulant Graphs by Certain Graphs
... edge of H twice and the intersection of any two of them contains exactly one edge. An ODC 𝒢 of 𝐻 is cyclic (CODC) if the cyclic group of order |𝑉(𝐻)| is a subgroup of the automorphism group of 𝒢 . In this paper we are ...
8
On -hued Coloring of Some Perfect and Circulant Graphs
... Coloring of Graphs based on multi-agentsystems(MAS). An MAS can be modeled as a graph for which a typical vertex represents a situation in which the typical individual has a great variety in the type of relations. ...
6
Vertex Domination Critical in Circulant Graphs
... Abstract. A graph G is vertex domination critical if for any vertex v of G, the domination number of G – v is less than the domination number of G. We call these graphs γ-critical if domination number of G is γ. ...
12
Combinatorial Properties of Circulant Networks
... The circulant is a natural generalization of the double loop network and was first considered by Wong and Coppersmith ...[18]. Circulant graphs have been used for decades in the design of computer ...
5
Reliability Measures in Circulant Network
... The circulant is a natural generalization of the double loop network and was first considered by Wong and Coppersmith ...[16]. Circulant graphs have been used for decades in the design of computer ...
5
Embeddings Between Circulant Networks and Hypertrees
... The circulant network is a natural generalization of the double loop network ...[12]. Circulant graphs have been used for decades in the design of computer and telecommunica- tion networks due to its ...
5
Wirelength of Circulant Networks into Wheel Related Graphs
... Abstract. Circulant graphs are an important class of topological structures of interconnection networks which have been used for decades in the design of computer and telecommunication networks due to their ...
7
Vol 8, No 2 (2017)
... Keywords: Square fuzzy graphs, regular fuzzy graphs, strong fuzzy graphs, complete fuzzy graphs, order and size of fuzzy graphs.. AMS Mathematics subject classification (2010):.[r] ...
5
Encryption of Data using Elliptic Curve over Circulant Matrices
... In this study an algorithm for ECC based on matrices will be proposed, which is structurally and functionally divided into two basic parts. The first part deals with the pre-processing of data (traversing of the data). ...
5
On the norms of an r circulant matrix with the generalized k Horadam numbers
... Remark We should note that choosing suitable values on r, f (k), g(k), a and b in The- orems , and , lower and upper bounds of the spectral norm, eigenvalues and deter- minant of r-circulant matrices for the ...
8
Trends in Fuzzy Graphs
... A graph is a symmetric binary relation on a nonempty set V. Similarly, a fuzzy graph is a symmetric binary fuzzy relation on a fuzzy subset. The first definition of a fuzzy graph was by Kaufmann[1] in 1973, based on ...
5
FOUR-DIMENSIONAL ALMOST EINSTEIN MANIFOLDS WITH SKEW-CIRCULANT STRUCTURES
... In the present work we study a four-dimensional differentiable manifold M with a Riemannian metric g. The manifold M is equipped locally with an additional structure S, which satisfies S 4 = − id. The component matrix of ...
14
Cyclic Convolution Algorithm Formulations Using Polynomial Transform Theory
... This section shows the process to obtain recursive algorithms in order to perform the polynomial product of length N modulo the polynomial p ( z ) ( z N 1 ) when N is a power of 2. In the development a matrix ...
9
A note on the 2 circulant inequalities for the max cut problem
... We have presented a (relatively) simple exact separation algorithm for (a generalisation of) the 2-circulant inequalities of Poljak & Turzik [24], which runs in O nf 2 time, where n is the number of nodes and ...
12
A Comparison on Metric Dimension of Graphs, Line Graphs, and Line Graphs of the Subdivision Graphs
... Abstract. The line graph L(G) of a simple graph G is the graph whose vertices are in one-to-one correspondence with the edges of G; two vertices of L(G) are adjacent if and only if the corresponding edges of G are ...
15
Chandoul
... Abstract: In this paper, we obtain a generalization of [6, 8]. Firstly, we consider the so-called r−circulant ma- trices with generalized Fibonacci numbers and then found lower and upper bounds for the Euclidean ...
9
Certain Classes of Fuzzy Graphs
... The operations of joining electrical components in parallel and in series are very impor- tant in electrical network theory. Graphs may be also constructed through an operation known as the parallel connection. ...
9