Searcharxiv⌕ Search

arXiv subjects

Eranda Dhananjaya

Publications and source records attributed to Eranda Dhananjaya.

3 recordsLinked to original sources

Good colorings of doubled triangles and a conjecture of Schwartz

A good coloring of a sphere triangulation is a black-and-white coloring of its faces such that, at every vertex, the numbers of black and white faces differ by a multiple of~$3$. Good colorings correspond to proper vertex $4$-colorings. For a good coloring with fold count $\mathrm{f}$ (the number of black-white edges) on a triangulation with $F$ faces, R.~E.~Schwartz introduced the Eisenstein isoperimetric ratio $η=\mathrm{f}^2/F$. For triangulations with degree sequence $6,\dots,6,2,2,2$, he proved that $η\ge3$ and conjectured that every such triangulation has a good coloring with $η$ below a universal constant. These triangulations are indexed by the nonzero Eisenstein integers~$β$. We study the family $\T(n)$ given by $β=n$, a positive integer, which consists of the doubled equilateral triangles of side~$n$. We prove that every good coloring of $\T(n)$ has at least $3n$ folds, so $η\ge9/2$, and that this bound is attained for every~$n$. Thus the minimum of $η$ on this family is exactly $9/2$, and Schwartz's conjecture holds for it. We also prove that subdividing a good coloring of $\T(β)$ gives a good coloring of $\T(nβ)$ with the same value of $η$. Consequently, Schwartz's conjecture holds in general if and only if it holds for primitive Eisenstein integers.

math.CO↗

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

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,\ldots,|E(G)|\}$ such that any two vertices have distinct vertex sums, where the vertex sum of a vertex is the sum of the labels of the in-edges minus that of the out-edges incident to the vertex. It is conjectured by Hefetz, Mütze, and Schwartz that every connected graph admits an antimagic orientation. A weak version of this problem is to require the distinct vertex sums only for the adjacent vertices. In that case, we say the graph admits a local antimagic orientation. Chang, Jing, and Wang~\cite{CJW20} conjectured that every connected graph admits a local antimagic orientation. In this paper, we give an affirmative answer to the conjecture of Chang et al., and show that almost every graph satisfies the conjecture of Hefetz et al.

math.CO↗

The antimagic orientation problems for graphs obtained by some graph operations

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,\ldots,|E(G)|\}$ such that the vertex sums of vertices are pairwise distinct, where the vertex sum of a vertex is defined to be the sum of the labels of the in-edges minus that of the out-edges incident to the vertex. It was conjectured by Hefetz, Mütze, and Schwartz~\cite{HMS10} in 2010 that every connected simple graph admits an antimagic orientation. In this paper, we prove that the Mycielski construction and the corona product for graphs with some conditions yield graphs satisfying the above conjecture.

math.CO↗