Modular chromatic number on inflated graphs of some tree graphs

Dimensions

Sumathi, P. and Tamilselvi, S. (2024) Modular chromatic number on inflated graphs of some tree graphs. Journal of Interdisciplinary Mathematics, 27 (5). pp. 1039-1052. ISSN 09720502

Full text not available from this repository.

Abstract

For any graph G(V, E), V(G) is the vertex set and E(G) is the edge set. Let the vertex coloring be called modular coloring mc(G) of G if any two adjacent vertices receive different color sums. In this paper, the structural properties of an inflated tree-related graph were discussed, and in addition, the modular chromatic number for the same was determined. © 2024 Elsevier B.V., All rights reserved.

Item Type: Article
Subjects: Mathematics > Discrete Mathematics and Combinatorics
Divisions: Arts and Science > School of Arts and Science, Chennai > Mathematics
Depositing User: Unnamed user with email techsupport@mosys.org
Last Modified: 27 Nov 2025 05:25
URI: https://vmuir.mosys.org/id/eprint/1503

Actions (login required)

View Item
View Item