5 papers · 1 filter
On Spectra of -Gain Digraphs
Shivani Tushar Parab, Tarkeshwar Singh, Mukesh Kumar Nagar
A \(\mathbb{T}\)-gain digraph is a directed graph with complex unit gains on its arcs, allowing for no restrictions on oppositely directed arcs. This framework unifies various grap…
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…
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…
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…
A Complete Characterization of all Magic Constants Arising from Distance Magic Graphs
Ravindra Pawar, Tarkeshwar Singh, Himadri Mukherjee +1
A positive integer is called a magic constant if there is a graph along with a bijective function from to first natural numbers such that the weight of…