E. Dhananjaya

collaborators

2 papers

math.CO2024

Every connected graph admits a local antimagic orientation and almost every graph admits an antimagic orientation

Eranda Dhananjaya, Wei-Tian Li

An undirected graph $G$ is said to admit an antimagic orientation if there exist an orientation $D$ and a bijection between $E (G)$ and ${1, 2, \dots, ∣ E (G) ∣}$ such that any two ver…

math.CO2020

The antimagic orientation problems for graphs obtained by some graph operations

Eranda Dhananjaya, Wei-Tian Li

A simple graph $G$ is said to admit an antimagic orientation if there exist an orientation on the edges of $G$ and a bijection from $E (G)$ to ${1, 2, \dots, ∣ E (G) ∣}$ such that the…