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
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.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…