collaborators
Showing math.COShow all

6 papers · 1 filter

math.CO2025

Quasi Neighborhood Balanced Coloring of Graphs

Maurice Genevieva Almeida

For a simple graph G = (V, E), a coloring of vertices of G using two colors, say red and blue, is called a quasi neighborhood balanced coloring if, for every vertex of the graph, t…

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

Neighborhood Balanced k-Coloring of Graphs

Maurice Genevieva Almeida, Tarkeshwar Singh, 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 each vertex has an equal number of n…

math.CO2025

Local Distance Antimagic Labeling of Neighborhood Balanced Colored Graphs

Maurice Genevieva Almeida, Tarkeshwar Singh, Andrea Semanicova Fenovcikova

Let be a graph without isolated vertices. A bijection is called a local distance antimagic labeling if for every edge $uv…

math.CO2025

-Neighborhood Balanced Coloring

Maurice Genevieva Almeida

Let be a simple graph and be a prime integer. Let each vertex of be colored using one of the colors, say . If every vertex has…

math.CO2024

Some Results on Local Distance Antimagic Chromatic Number of Graphs

Maurice Genevieva Almeida, Tarkeshwar Singh

Let G=(V,E) be a graph of order n without isolated vertices. A bijection f:V -- {1,2,...n} is called a local distance antimagic labeling if the weights of any two adjacent vertices…