The general position number of a connected graph is the cardinality of a largest set of
vertices such that no three pairwise-distinct vertices from the set lie on a common shortest …

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 …

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 …

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 …