[PDF][PDF] Determining the b-chromatic number of subdivision-vertex neighbourhood coronas.
RM Falcón, M Venkatachalam… - Analele Stiintifice ale …, 2024 - sciendo.com
Let G and H be two graphs, each one of them being a path, a cycle or a star. In this paper,
we determine the b-chromatic number of every subdivision-vertex neighbourhood corona …
we determine the b-chromatic number of every subdivision-vertex neighbourhood corona …
-coloring of Cartesian Product of Trees
R Balakrishnan, S Francis Raj, T Kavaskar - 2016 - projecteuclid.org
A b-coloring of a graph G with k colors is a proper coloring of G using k colors in which each
color class contains a color dominating vertex, that is, a vertex which has a neighbor in each …
color class contains a color dominating vertex, that is, a vertex which has a neighbor in each …
Solving the -coloring problem for subdivision-edge neighborhood coronas
RM Falcón, M Venkatachalam… - Discrete Mathematics …, 2024 - World Scientific
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 …
corona of paths, cycles, stars and complete graphs. In addition, some exact values and …
Department of Mathematics, Pondicherry University, Puducherry 605014, India francisraj_s@ yahoo. com, gokulnath. math@ gmail. com
SF Raj - Algorithms and Discrete Applied Mathematics: 5th …, 2019 - books.google.com
The b-chromatic number b (G) of a graph G is the maximum k for which G has a proper
vertex coloring using k colors such that each color class contains at least one vertex …
vertex coloring using k colors such that each color class contains at least one vertex …
b-Coloring of the Mycielskian of Regular Graphs
S Francis Raj, M Gokulnath - Conference on Algorithms and Discrete …, 2019 - Springer
The b-chromatic number b (G) of a graph G is the maximum k for which G has a proper
vertex coloring using k colors such that each color class contains at least one vertex …
vertex coloring using k colors such that each color class contains at least one vertex …