M. Almeida

collaborators

3 papers

math.CO2025

Closed Neighborhood Balanced k-Coloring of Graphs

Maurice Almeida, Ravindra Pawar, Siddharth Gupta +1

For a simple graph G = (V, E) and a positive integer k greater than or equal to 2, a coloring of vertices of G using exactly k colors such that every vertex has an equal number of…

math.CO2025

Local Distance Antimagic Labeling of Neighborhood Balanced Graphs

Maurice Genevieva Almeida

Let G = (V, E) be a graph of order n without isolated vertices. A bijection f from vertex set of G to the set of integers from 1 to n is called a local distance antimagic labeling,…

math.CO2025

$(2 k + 1)$ -Neighborhood Balanced Coloring

Maurice Genevieva Almeida

Let $G = (V, E)$ be a simple graph and $(2 k + 1)$ be a prime integer. Let each vertex of $G$ be colored using one of the $(2 k + 1)$ colors, say $R_{1}, R_{2}, ..., R_{2 k + 1}$ . If every vertex has…

Closed Neighborhood Balanced k-Coloring of Graphs

Local Distance Antimagic Labeling of Neighborhood Balanced Graphs

(2k+1)-Neighborhood Balanced Coloring

$(2 k + 1)$ -Neighborhood Balanced Coloring