Further studies on circulant completion of graphs

Title

Further studies on circulant completion of graphs

Creator

Antony T.B.; Naduvath S.

Description

A circulant graph C(n, S) is a graph having its adjacency matrix as a circulant matrix. It can also be interpreted as a graph with vertices v0, v1,,vn?1 that are in one-to-one correspondence with the members of Zn and with edge set {vivj: i ? j ? S}, where S known as the connection set or symbol, is a subset of non-identity members of Zn that is closed under inverses. This work extends the study of circulant completion and general formulae for calculating circulant completion numbers in two different perspectives, one in terms of circulant span and the other in terms of the adjacency matrix. (2024), (SciELO-Scientific Electronic Library Online). All Rights Reserved.

Source

Proyecciones, Vol-43, No. 3, pp. 761-773.

Date

2024-01-01

Publisher

Universidad Catolica del Norte

Subject

c-diagonal modulo n; c-trace; circulant completion; circulant completion graph; circulant completion number; circulant labelling; circulant span; ?-completion

Coverage

Antony T.B., CHRIST (Deemed to be University), India; Naduvath S., CHRIST (Deemed to be University), India

Rights

All Open Access; Gold Open Access

Relation

ISSN: 7160917

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.22199/issn.0717-6279-6034

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85202462817&doi=10.22199%2fissn.0717-6279-6034&partnerID=40&md5=fed68f97990e00a8286c386ef6cd1d42