A Study on Ornated Graphs

Title

A Study on Ornated Graphs

Creator

Kok J.; Naduvath S.; Mukungunugwa V.

Description

In this paper, we introduce the notion of a finite non-simple directed graph called, an ornated graph. An ornated graph is a directed graph on n vertices, denoted by On(sl), whose vertices are consecutively labeled clockwise on the circumference of a circle and constructed from an ordered string sl. Joining vertices is such that for an odd indexed entry at of the string, a tail vertex vi has clockwise heads vj if and only if (i + at) ? j. For an even indexed entry as of the string, a tail vertex vi has anticlockwise heads vj if and only if (i - as) ? j. Some interesting results for certain types of ornated graphs are presented. 2023 World Scientific Publishing Company.

Source

Journal of Interconnection Networks, Vol-23, No. 1

Date

2022-01-01

Publisher

World Scientific

Subject

Degree sequence; Kyle graph; ornated graph; symmetric directed graph

Coverage

Kok J., Department of Mathematics, CHRIST (Deemed to be University), Bangalore, India; Naduvath S., Department of Mathematics, CHRIST (Deemed to be University), Bangalore, India; Mukungunugwa V., Department of Mathematics and Applied Mathematics, University of Zimbabwe, 630 Churchill Ave, Harare, Harare, Zimbabwe

Rights

Restricted Access

Relation

ISSN: 2192659

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.1142/S0219265921500353

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85135418118&doi=10.1142%2fS0219265921500353&partnerID=40&md5=ac152045ace1cf693e7a06e156f72f07