Back to Search Start Over

Solving the b-coloring problem for subdivision-edge neighborhood coronas.

Authors :
Falcón, Raúl M.
Venkatachalam, M.
Margaret, S. Julie
Source :
Discrete Mathematics, Algorithms & Applications; Feb2024, Vol. 16 Issue 2, p1-17, 17p
Publication Year :
2024

Abstract

In this paper, the b -coloring problem is solved for every subdivision-edge neighborhood corona of paths, cycles, stars and complete graphs. In addition, some exact values and sharp bounds are established for the b -chromatic number of subdivision-edge neighborhood coronas of these graphs with any other graph. [ABSTRACT FROM AUTHOR]

Subjects

Subjects :
SUBDIVISION surfaces (Geometry)
PROBLEM solving
NEIGHBORHOODS
COMPLETE graphs

Details

Language :
English
ISSN :
17938309
Volume :
16
Issue :
2
Database :
Complementary Index
Journal :
Discrete Mathematics, Algorithms & Applications
Publication Type :
Academic Journal
Accession number :
174157793
Full Text :
https://doi.org/10.1142/S179383092350009X
Full Text Access
View/download PDF

Tools

Authors Abstract Subjects Details