On Circulant Completion of Graphs

Title

On Circulant Completion of Graphs

Creator

Antony T.B.; Naduvath S.

Description

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.

Source

Lecture Notes in Networks and Systems, Vol-462, pp. 181-188.

Date

2022-01-01

Publisher

Springer Science and Business Media Deutschland GmbH

Subject

? -completion; Circulant completion; Circulant completion graph; Circulant completion number; Circulant labelling; Circulant span

Coverage

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

Rights

Restricted Access

Relation

ISSN: 23673370; ISBN: 978-981192210-7

Format

Online

Language

English

Type

Conference paper

Identifier

https://doi.org/10.1007/978-981-19-2211-4_15

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85135040196&doi=10.1007%2f978-981-19-2211-4_15&partnerID=40&md5=6904684f11ae22dfad619a848ecf47c9