2000 character limit reached
D-Antimagic Labelings of Oriented Star Forests
Published 9 Jan 2025 in math.CO | (2501.05148v1)
Abstract: For a distance set $D$, an oriented graph $\overrightarrow{G}$ is $D$-antimagic if there exists a bijective vertex labeling such that the sum of all labels of $D$-out-neighbors is distinct for each vertex. This paper provides all orientations and all possible $D$s of a $D$-antimagic oriented star. We provide necessary and sufficient condition for $D$-antimagic oriented star forest containing isomorphic oriented stars. We show that for all possible $D$s, there exists an orientation for a star forest to admit a $D$-antimagic labeling.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.