The Strongly Antimagic labelings of Double Spiders
Abstract
A graph G=(V,E) is strongly antimagic, if there is a bijective mapping f: E \1,2,…,|E|\ such that for any two vertices u≠ v, not only Σe ∈ E(u)f(e) Σe∈ E(v)f(e) and also Σe ∈ E(u)f(e) < Σe∈ E(v)f(e) whenever (u)< (v) , where E(u) is the set of edges incident to u. In this paper, we prove that double spiders, the trees contains exactly two vertices of degree at least 3, are strongly antimagic.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.