Ravindra Pawar

collaborators

5 papers

math.CO2023

A Complete Characterization of all Magic Constants Arising from Distance Magic Graphs

Ravindra Pawar, Tarkeshwar Singh, Himadri Mukherjee +1

A positive integer $k$ is called a magic constant if there is a graph $G$ along with a bijective function $f$ from $V (G)$ to first $∣ V (G) ∣$ natural numbers such that the weight of…

math.CO2023

Distance Magic Labeling of Generalised Mycielskian Graphs

Ravindra Pawar, Tarkehswar Singh

In this paper, we have studied the distance magic labelling of Generalised Mycielskian of a few families of graphs.

math.CO2023

Local Antimagic Coloring of Some Graphs

Ravindra Pawar, Tarkeshwar Singh, Adarsh Handa +1

Given a graph $G = (V, E)$ , a bijection $f : E \to {1, 2, \dots, ∣ E ∣}$ is called a local antimagic labeling of $G$ if the vertex weight $w (u) = \sum_{uv \in E} f (uv)$ is dist…

math.CO2023

Super Total Local Antimagic Vertex Coloring of Graphs

Ravindra Pawar, Tarkeshwar Singh

Let $G = (V, E)$ be a finite simple undirected graph without isolated vertices. A bijective map $f : V \cup E \to {1, 2, \dots, ∣ V ∣ + ∣ E ∣}$ is called total local antimagic l…

math.CO2023

On Structural and Spectral Properties of Distance Magic Graphs

Himadri Mukherjee, Ravindra Pawar, Tarkeshwar Singh

A graph $G = (V, E)$ is said to be distance magic if there is a bijection $f$ from a vertex set of $G$ to the first $∣ V (G) ∣$ natural numbers such that for each vertex $v$ , its weight…