M. Acharya

most citedParity Labeling in Signed Graphs

5 citations · 6 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2026

Construction of additively graceful signed graphs-I

Mukti Acharya

In this paper, we construct additively graceful signed graphs S from a given graph G that may be additively graceful or not be additively graceful. We also show the construction of…

math.CO2020★ 5 cited

Parity Labeling in Signed Graphs

Mukti Acharya, Joseph Varghese Kureethara

Let $S = (G, σ)$ be a signed graph where $G = (V, E)$ is a graph called the underlying graph of $S$ and $σ : E (G) \to {+, -}$ . Let $f : V (G) \to {1, 2, \dots, ∣ V (G) ∣}$ suc…

math.CO2020★ 1 cited

Characterizations of Some Parity Signed Graphs

Mukti Acharya, Joseph Varghese Kureethara, Thomas Zaslavsky

We describe parity labelings of signed graphs; equivalently, cuts of the underlying graph that have nearly equal sides. We characterize the balanced signed graphs which are parity…