? -completion; Circulant completion; Circulant completion graph; Circulant completion number; Circulant labelling; Circulant span
A graph G with vertex set as {v0, v1, v2,.., vn-1} corresponding to the elements of Zn, the group of integers under addition modulo n, is said to be a circulant graph if the edge set of G consists of all edges of the form {vi, vj} where (i-j)(modn)?S?{1,2,,n-1}, that is, closed under inverses. The set S is known as the connection set. In this paper, we present some techniques and characterisations which enable us to obtain a circulant completion graph of a given graph and thereby evaluate the circulant completion number. The obtained results provide the basic eligibilities for a graph to have a particular circulant completion graph. 2022, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
Lecture Notes in Networks and Systems, Vol-462, pp. 181-188.
Springer Science and Business Media Deutschland GmbH
Antony T.B., Department of Mathematics, CHRIST (Deemed to be University), Bangalore, India; Naduvath S., Department of Mathematics, CHRIST (Deemed to be University), Bangalore, India