Further Results on the 3-Consecutive Vertex Coloring Number of Certain Graphs

Title

Further Results on the 3-Consecutive Vertex Coloring Number of Certain Graphs

Creator

John D.; Dominic C.; Vallikavungal J.

Description

A 3-consecutive vertex coloring is an assignment of colors on vertices of a graph G such that for any 3-consecutive vertices a, b and c, the color of b is the same as the color of a or c. ? 3c(G) denotes the maximum number of colors that can be used to 3-consecutive vertex color a graph G. The main aim of this article is to give the value of ? 3c(G) for some particular types of graphs, which includes: necklace graphs; the Cartesian product of two paths, a cycle and a path, and two cycles; the corona product of a path and a clique; Mobius Ladder graphs; the 3rd edge line graph; triangular snake graphs, double triangular snake graphs, triple triangular snake graphs, quadrilateral snake graphs and the alternative versions of them; Hanoi graphs; Sun graphs; Barbel graphs; the n-pan graph. The objective of this article is to explore some important results on ? 3c(G). 2024 The Authors.

Source

IEEE Access, Vol-12, pp. 144164-144173.

Date

2024-01-01

Publisher

Institute of Electrical and Electronics Engineers Inc.

Subject

3-consecutive vertex coloring; 3-consecutive vertex coloring number; corona product; necklace graphs; snake graphs

Coverage

John D., Christ University, Department of Mathematics, Bengaluru, 560029, India; Dominic C., Christ University, Department of Mathematics, Bengaluru, 560029, India; Vallikavungal J., Tecnologico de Monterrey, School of Engineering and Sciences, Monterrey, 64849, Mexico

Rights

All Open Access; Gold Open Access

Relation

ISSN: 21693536

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.1109/ACCESS.2024.3471858

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85205852697&doi=10.1109%2fACCESS.2024.3471858&partnerID=40&md5=0c90e21d9da37b849b1e54228994c6e0