Daphne Der-Fen Liu

activity

20162023

most citedAn Inductive Approach to Strongly Antimagic Labelings of Graphs

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

collaborators

7 papers

math.CO2023

Antimagic Labelings of Forests

Johnny Sierra, Daphne Der-Fen Liu, Jessica Toy

An antimagic labeling of a graph $G (V, E)$ is a bijection $f : E \to {1, 2, \dots, ∣ E ∣}$ so that $\sum_{e \in E (u)} f (e) \neq = \sum_{e \in E (v)} f (e)$ holds for all $u, v \in V (G)$ w…

math.CO2022★ 1 cited

An Inductive Approach to Strongly Antimagic Labelings of Graphs

Daphne Der-Fen Liu, Vicente Lossada

An antimagic labeling for a graph $G$ with $m$ edges is a bijection $f : E (G) \to {1, 2, \dots, m}$ so that $ϕ_{f} (u) \neq = ϕ_{f} (v)$ holds for any pair of distinct vertices $u, v \in…

math.CO2022

Antimagic Labeling for Unions of Graphs with Many Three-Paths

Angel Chavez, Parker Le, Derek Lin +2

Let $G$ be a graph with $m$ edges and let $f$ be a bijection from $E (G)$ to ${1, 2, \dots, m}$ . For any vertex $v$ , denote by $ϕ_{f} (v)$ the sum of $f (e)$ over all edges $e$ inciden…

math.CO2022

Radio Number for the Cartesian Product of Two Trees

Devsi Bantva, Daphne Der-Fen Liu

Let $G$ be a simple connected graph. For any two vertices $u$ and $v$ , let $d (u, v)$ denote the distance between $u$ and $v$ in $G$ , and let $d iam (G)$ denote the diameter of $G$ . A…

math.CO2021

Optimal Radio Labellings of Block Graphs and Line Graphs of Trees

Devsi Bantva, Daphne Der-Fen Liu

A radio labeling of a graph $G$ is a mapping $f$ : $V (G) \to {0, 1, 2, ...}$ such that $∣ f (u) - f (v) ∣ \geq d iam (G) + 1 - d (u, v)$ holds for every pair of vertices $u$ and $v$ …

math.CO2021

Radio-k-Labeling of Cycles for Large k

Colin Bloomfield, Daphne Der-Fen Liu, Jeannette Ramirez

Let $G$ be a simple connected graph. For any two vertices $u$ and $v$ , let $d (u, v)$ denote the distance between $u$ and $v$ in $G$ . A radio- $k$ -labeling of $G$ for a fixed positive…

math.CO2016

Sequences of Integers with Three Missing Separations

Daphne Der-Fen Liu, Grant Robinson

Fix a set $D$ of positive integers. We study the maximum density $μ (D)$ of sequences of integers in which the separation between any two terms does not fall in $D$ . The $D$ -sets co…