<p>For a simple graph <i>G</i>, a <i>graceful antimagic injection</i> <i>f</i> in [0,&#xa0;<i>M</i>] is a map <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(f: V(G)\rightarrow [0, M]\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>f</mi> <mo>:</mo> <mi>V</mi> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> <mo stretchy="false">→</mo> <mo stretchy="false">[</mo> <mn>0</mn> <mo>,</mo> <mi>M</mi> <mo stretchy="false">]</mo> </mrow> </math></EquationSource> </InlineEquation> such that the induced edge labels are different for all distinct edges and the vertex weights are different for all distinct vertices, where the induced edge label of <i>uv</i> is <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(f^*(uv)=|f(u)-f(v)|\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msup> <mi>f</mi> <mo>∗</mo> </msup> <mrow> <mo stretchy="false">(</mo> <mi>u</mi> <mi>v</mi> <mo stretchy="false">)</mo> </mrow> <mo>=</mo> <mrow> <mo stretchy="false">|</mo> <mi>f</mi> <mrow> <mo stretchy="false">(</mo> <mi>u</mi> <mo stretchy="false">)</mo> </mrow> <mo>-</mo> <mi>f</mi> <mrow> <mo stretchy="false">(</mo> <mi>v</mi> <mo stretchy="false">)</mo> </mrow> <mo stretchy="false">|</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> and the vertex weight of <i>v</i> is <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(\omega (v)=\sum _{uv\in E(G)}f^*(uv)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>ω</mi> <mrow> <mo stretchy="false">(</mo> <mi>v</mi> <mo stretchy="false">)</mo> </mrow> <mo>=</mo> <msub> <mo>∑</mo> <mrow> <mi>u</mi> <mi>v</mi> <mo>∈</mo> <mi>E</mi> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> </mrow> </msub> <msup> <mi>f</mi> <mo>∗</mo> </msup> <mrow> <mo stretchy="false">(</mo> <mi>u</mi> <mi>v</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>. If <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(\mathcal {Y}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="script">Y</mi> </math></EquationSource> </InlineEquation> is a class of graphs of order <i>n</i> and size <i>m</i> not containing <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(\bigcup K_2\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo>⋃</mo> <msub> <mi>K</mi> <mn>2</mn> </msub> </mrow> </math></EquationSource> </InlineEquation>, <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\(GA(\mathcal {Y},n,m)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>G</mi> <mi>A</mi> <mo stretchy="false">(</mo> <mi mathvariant="script">Y</mi> <mo>,</mo> <mi>n</mi> <mo>,</mo> <mi>m</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> denotes the smallest integer <i>M</i> such that every <InlineEquation ID="IEq7"> <EquationSource Format="TEX">\(G\in \mathcal {Y}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>G</mi> <mo>∈</mo> <mi mathvariant="script">Y</mi> </mrow> </math></EquationSource> </InlineEquation> admits a graceful antimagic injection in [0,&#xa0;<i>M</i>]. For <InlineEquation ID="IEq8"> <EquationSource Format="TEX">\(\mathcal {G}_\Delta \subset \mathcal {Y}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi mathvariant="script">G</mi> <mi mathvariant="normal">Δ</mi> </msub> <mo>⊂</mo> <mi mathvariant="script">Y</mi> </mrow> </math></EquationSource> </InlineEquation> with a maximum degree <InlineEquation ID="IEq9"> <EquationSource Format="TEX">\(\Delta \)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="normal">Δ</mi> </math></EquationSource> </InlineEquation>, we utilize Alon’s Combinatorial Nullstellensatz to find an upper bound for <InlineEquation ID="IEq10"> <EquationSource Format="TEX">\(GA(\mathcal {G}_\Delta ,n,m)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>G</mi> <mi>A</mi> <mo stretchy="false">(</mo> <msub> <mi mathvariant="script">G</mi> <mi mathvariant="normal">Δ</mi> </msub> <mo>,</mo> <mi>n</mi> <mo>,</mo> <mi>m</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>, that is, <InlineEquation ID="IEq11"> <EquationSource Format="TEX">\(GA(\mathcal {G}_\Delta ,n,m)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>G</mi> <mi>A</mi> <mo stretchy="false">(</mo> <msub> <mi mathvariant="script">G</mi> <mi mathvariant="normal">Δ</mi> </msub> <mo>,</mo> <mi>n</mi> <mo>,</mo> <mi>m</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> <InlineEquation ID="IEq12"> <EquationSource Format="TEX">\(\le n+p(m-p)+\Delta (2n-4)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo>≤</mo> <mi>n</mi> <mo>+</mo> <mi>p</mi> <mo stretchy="false">(</mo> <mi>m</mi> <mo>-</mo> <mi>p</mi> <mo stretchy="false">)</mo> <mo>+</mo> <mi mathvariant="normal">Δ</mi> <mo stretchy="false">(</mo> <mn>2</mn> <mi>n</mi> <mo>-</mo> <mn>4</mn> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>, where <InlineEquation ID="IEq13"> <EquationSource Format="TEX">\(p=\min \{\Delta ,\lfloor \frac{n}{2}\rfloor \}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>p</mi> <mo>=</mo> <mo movablelimits="true">min</mo> <mo stretchy="false">{</mo> <mi mathvariant="normal">Δ</mi> <mo>,</mo> <mrow> <mo>⌊</mo> <mfrac> <mi>n</mi> <mn>2</mn> </mfrac> <mo>⌋</mo> </mrow> <mo stretchy="false">}</mo> </mrow> </math></EquationSource> </InlineEquation>. We also prove that if <InlineEquation ID="IEq14"> <EquationSource Format="TEX">\(\mathcal {T}_q \subset \mathcal {Y}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi mathvariant="script">T</mi> <mi>q</mi> </msub> <mo>⊂</mo> <mi mathvariant="script">Y</mi> </mrow> </math></EquationSource> </InlineEquation> is a class of trees whose base tree has <i>q</i> inner vertices, then <InlineEquation ID="IEq15"> <EquationSource Format="TEX">\(GA(\mathcal {T}_q,n,n-1) \le 2n+q-3\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>G</mi> <mi>A</mi> <mo stretchy="false">(</mo> <msub> <mi mathvariant="script">T</mi> <mi>q</mi> </msub> <mo>,</mo> <mi>n</mi> <mo>,</mo> <mi>n</mi> <mo>-</mo> <mn>1</mn> <mo stretchy="false">)</mo> <mo>≤</mo> <mn>2</mn> <mi>n</mi> <mo>+</mo> <mi>q</mi> <mo>-</mo> <mn>3</mn> </mrow> </math></EquationSource> </InlineEquation>. We introduce a variant of the previous notion of injection, that is, the graceful <InlineEquation ID="IEq16"> <EquationSource Format="TEX">\(\mathbb {D}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="double-struck">D</mi> </math></EquationSource> </InlineEquation>-antimagic injection. Let <i>G</i> be a simple graph with diameter <InlineEquation ID="IEq17"> <EquationSource Format="TEX">\({\textrm{diam}}(G)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mtext>diam</mtext> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>. Suppose that <InlineEquation ID="IEq18"> <EquationSource Format="TEX">\(\mathbb {D}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="double-struck">D</mi> </math></EquationSource> </InlineEquation> is a nonempty subset of the distance set <InlineEquation ID="IEq19"> <EquationSource Format="TEX">\(\{0,1,\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">{</mo> <mn>0</mn> <mo>,</mo> <mn>1</mn> <mo>,</mo> </mrow> </math></EquationSource> </InlineEquation> <InlineEquation ID="IEq20"> <EquationSource Format="TEX">\(\ldots , {\textrm{diam}}(G)\}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo>…</mo> <mo>,</mo> <mtext>diam</mtext> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> <mo stretchy="false">}</mo> </mrow> </math></EquationSource> </InlineEquation> and the <InlineEquation ID="IEq21"> <EquationSource Format="TEX">\(\mathbb {D}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="double-struck">D</mi> </math></EquationSource> </InlineEquation>-<i>neighborhood</i> of a vertex <i>v</i>, <InlineEquation ID="IEq22"> <EquationSource Format="TEX">\(N_{\mathbb {D}}(v)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>N</mi> <mi mathvariant="double-struck">D</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>v</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>, is the set of all vertices <i>u</i> with <InlineEquation ID="IEq23"> <EquationSource Format="TEX">\(d(u,v)\in \mathbb {D}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>d</mi> <mo stretchy="false">(</mo> <mi>u</mi> <mo>,</mo> <mi>v</mi> <mo stretchy="false">)</mo> <mo>∈</mo> <mi mathvariant="double-struck">D</mi> </mrow> </math></EquationSource> </InlineEquation>. <i>A graceful</i> <InlineEquation ID="IEq24"> <EquationSource Format="TEX">\(\mathbb {D}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="double-struck">D</mi> </math></EquationSource> </InlineEquation>-<i>antimagic injection</i> <i>f</i> in [0,&#xa0;<i>N</i>] is a map <InlineEquation ID="IEq25"> <EquationSource Format="TEX">\(f: V(G)\rightarrow [0,N]\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>f</mi> <mo>:</mo> <mi>V</mi> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> <mo stretchy="false">→</mo> <mo stretchy="false">[</mo> <mn>0</mn> <mo>,</mo> <mi>N</mi> <mo stretchy="false">]</mo> </mrow> </math></EquationSource> </InlineEquation> such that all induced edge labels are distinct and all <InlineEquation ID="IEq26"> <EquationSource Format="TEX">\(\mathbb {D}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="double-struck">D</mi> </math></EquationSource> </InlineEquation>-vertex weights are also distinct, where the <InlineEquation ID="IEq27"> <EquationSource Format="TEX">\(\mathbb {D}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="double-struck">D</mi> </math></EquationSource> </InlineEquation>-vertex weight of <i>v</i> is the sum of the labels of the vertices in <InlineEquation ID="IEq28"> <EquationSource Format="TEX">\(N_{\mathbb {D}}(v)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>N</mi> <mi mathvariant="double-struck">D</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>v</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>. If <InlineEquation ID="IEq29"> <EquationSource Format="TEX">\(\mathcal {X}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="script">X</mi> </math></EquationSource> </InlineEquation> is a class of graphs of order <i>n</i> and size <i>m</i> such that no two vertices have the same <InlineEquation ID="IEq30"> <EquationSource Format="TEX">\(\mathbb {D}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="double-struck">D</mi> </math></EquationSource> </InlineEquation>-neighborhood, the smallest possible <i>N</i> such that every graph in <InlineEquation ID="IEq31"> <EquationSource Format="TEX">\(\mathcal {X}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="script">X</mi> </math></EquationSource> </InlineEquation> has a graceful <InlineEquation ID="IEq32"> <EquationSource Format="TEX">\(\mathbb {D}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="double-struck">D</mi> </math></EquationSource> </InlineEquation>-antimagic injection is denoted by <InlineEquation ID="IEq33"> <EquationSource Format="TEX">\(G\mathbb {D}A(\mathcal {X},n,m)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>G</mi> <mi mathvariant="double-struck">D</mi> <mi>A</mi> <mo stretchy="false">(</mo> <mi mathvariant="script">X</mi> <mo>,</mo> <mi>n</mi> <mo>,</mo> <mi>m</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>. Let the <InlineEquation ID="IEq34"> <EquationSource Format="TEX">\(\mathbb {D}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="double-struck">D</mi> </math></EquationSource> </InlineEquation>-<i>degree</i> of a vertex <i>v</i> be the cardinality of <InlineEquation ID="IEq35"> <EquationSource Format="TEX">\(N_{\mathbb {D}}(v)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>N</mi> <mi mathvariant="double-struck">D</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>v</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>. For <InlineEquation ID="IEq36"> <EquationSource Format="TEX">\(\mathcal {G}_{\Delta ,\Delta _{\mathbb {D}}} \subset \mathcal {X}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi mathvariant="script">G</mi> <mrow> <mi mathvariant="normal">Δ</mi> <mo>,</mo> <msub> <mi mathvariant="normal">Δ</mi> <mi mathvariant="double-struck">D</mi> </msub> </mrow> </msub> <mo>⊂</mo> <mi mathvariant="script">X</mi> </mrow> </math></EquationSource> </InlineEquation> with a maximum degree <InlineEquation ID="IEq37"> <EquationSource Format="TEX">\(\Delta \)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="normal">Δ</mi> </math></EquationSource> </InlineEquation> and a maximum <InlineEquation ID="IEq38"> <EquationSource Format="TEX">\(\mathbb {D}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="double-struck">D</mi> </math></EquationSource> </InlineEquation>-degree <InlineEquation ID="IEq39"> <EquationSource Format="TEX">\(\Delta _{\mathbb {D}}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi mathvariant="normal">Δ</mi> <mi mathvariant="double-struck">D</mi> </msub> </math></EquationSource> </InlineEquation>, we prove that <InlineEquation ID="IEq40"> <EquationSource Format="TEX">\(G\mathbb {D}A(\mathcal {G}_{\Delta ,\Delta _{\mathbb {D}}},n,m) \le n+t(n-t)+p(m-p)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>G</mi> <mi mathvariant="double-struck">D</mi> <mi>A</mi> <mrow> <mo stretchy="false">(</mo> <msub> <mi mathvariant="script">G</mi> <mrow> <mi mathvariant="normal">Δ</mi> <mo>,</mo> <msub> <mi mathvariant="normal">Δ</mi> <mi mathvariant="double-struck">D</mi> </msub> </mrow> </msub> <mo>,</mo> <mi>n</mi> <mo>,</mo> <mi>m</mi> <mo stretchy="false">)</mo> </mrow> <mo>≤</mo> <mi>n</mi> <mo>+</mo> <mi>t</mi> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo>-</mo> <mi>t</mi> <mo stretchy="false">)</mo> </mrow> <mo>+</mo> <mi>p</mi> <mrow> <mo stretchy="false">(</mo> <mi>m</mi> <mo>-</mo> <mi>p</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>, where <InlineEquation ID="IEq41"> <EquationSource Format="TEX">\(t=\min \{\lfloor \frac{n}{2}\rfloor , \Delta _{\mathbb {D}}\}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>t</mi> <mo>=</mo> <mo movablelimits="true">min</mo> <mo stretchy="false">{</mo> <mrow> <mo>⌊</mo> <mfrac> <mi>n</mi> <mn>2</mn> </mfrac> <mo>⌋</mo> </mrow> <mo>,</mo> <msub> <mi mathvariant="normal">Δ</mi> <mi mathvariant="double-struck">D</mi> </msub> <mo stretchy="false">}</mo> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq42"> <EquationSource Format="TEX">\(p=\min \{\lfloor \frac{m}{2}\rfloor ,\Delta \}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>p</mi> <mo>=</mo> <mo movablelimits="true">min</mo> <mo stretchy="false">{</mo> <mrow> <mo>⌊</mo> <mfrac> <mi>m</mi> <mn>2</mn> </mfrac> <mo>⌋</mo> </mrow> <mo>,</mo> <mi mathvariant="normal">Δ</mi> <mo stretchy="false">}</mo> </mrow> </math></EquationSource> </InlineEquation>. Furthermore, if <InlineEquation ID="IEq43"> <EquationSource Format="TEX">\(\mathcal {T}_k \subset \mathcal {X}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi mathvariant="script">T</mi> <mi>k</mi> </msub> <mo>⊂</mo> <mi mathvariant="script">X</mi> </mrow> </math></EquationSource> </InlineEquation> is a class of trees with <i>k</i> leaves and <InlineEquation ID="IEq44"> <EquationSource Format="TEX">\(\mathbb {D}=\{1\}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="double-struck">D</mi> <mo>=</mo> <mo stretchy="false">{</mo> <mn>1</mn> <mo stretchy="false">}</mo> </mrow> </math></EquationSource> </InlineEquation>, we prove that <InlineEquation ID="IEq45"> <EquationSource Format="TEX">\(G\mathbb {D}A(\mathcal {T}_k,n,n-1) \le \max \{4n-6k-2, 3n-2k-3\}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>G</mi> <mi mathvariant="double-struck">D</mi> <mi>A</mi> <mrow> <mo stretchy="false">(</mo> <msub> <mi mathvariant="script">T</mi> <mi>k</mi> </msub> <mo>,</mo> <mi>n</mi> <mo>,</mo> <mi>n</mi> <mo>-</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> <mo>≤</mo> <mo movablelimits="true">max</mo> <mrow> <mo stretchy="false">{</mo> <mn>4</mn> <mi>n</mi> <mo>-</mo> <mn>6</mn> <mi>k</mi> <mo>-</mo> <mn>2</mn> <mo>,</mo> <mn>3</mn> <mi>n</mi> <mo>-</mo> <mn>2</mn> <mi>k</mi> <mo>-</mo> <mn>3</mn> <mo stretchy="false">}</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>. Moreover, if <InlineEquation ID="IEq46"> <EquationSource Format="TEX">\(\mathcal {T}_q \subset \mathcal {X}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi mathvariant="script">T</mi> <mi>q</mi> </msub> <mo>⊂</mo> <mi mathvariant="script">X</mi> </mrow> </math></EquationSource> </InlineEquation> is a class of trees whose base tree has <i>q</i> inner vertices and <InlineEquation ID="IEq47"> <EquationSource Format="TEX">\(\mathbb {D}=\{0,1\}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="double-struck">D</mi> <mo>=</mo> <mo stretchy="false">{</mo> <mn>0</mn> <mo>,</mo> <mn>1</mn> <mo stretchy="false">}</mo> </mrow> </math></EquationSource> </InlineEquation>, we prove that <InlineEquation ID="IEq48"> <EquationSource Format="TEX">\(G\mathbb {D}A(\mathcal {T}_q,n,n-1) \le 2n+q-3\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>G</mi> <mi mathvariant="double-struck">D</mi> <mi>A</mi> <mo stretchy="false">(</mo> <msub> <mi mathvariant="script">T</mi> <mi>q</mi> </msub> <mo>,</mo> <mi>n</mi> <mo>,</mo> <mi>n</mi> <mo>-</mo> <mn>1</mn> <mo stretchy="false">)</mo> <mo>≤</mo> <mn>2</mn> <mi>n</mi> <mo>+</mo> <mi>q</mi> <mo>-</mo> <mn>3</mn> </mrow> </math></EquationSource> </InlineEquation>.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Graceful Antimagic Injection via Combinatorial Nullstellensatz

  • R. Y. Wulandari,
  • R. Simanjuntak,
  • S. W. Saputro

摘要

For a simple graph G, a graceful antimagic injection f in [0, M] is a map \(f: V(G)\rightarrow [0, M]\) f : V ( G ) [ 0 , M ] such that the induced edge labels are different for all distinct edges and the vertex weights are different for all distinct vertices, where the induced edge label of uv is \(f^*(uv)=|f(u)-f(v)|\) f ( u v ) = | f ( u ) - f ( v ) | and the vertex weight of v is \(\omega (v)=\sum _{uv\in E(G)}f^*(uv)\) ω ( v ) = u v E ( G ) f ( u v ) . If \(\mathcal {Y}\) Y is a class of graphs of order n and size m not containing \(\bigcup K_2\) K 2 , \(GA(\mathcal {Y},n,m)\) G A ( Y , n , m ) denotes the smallest integer M such that every \(G\in \mathcal {Y}\) G Y admits a graceful antimagic injection in [0, M]. For \(\mathcal {G}_\Delta \subset \mathcal {Y}\) G Δ Y with a maximum degree \(\Delta \) Δ , we utilize Alon’s Combinatorial Nullstellensatz to find an upper bound for \(GA(\mathcal {G}_\Delta ,n,m)\) G A ( G Δ , n , m ) , that is, \(GA(\mathcal {G}_\Delta ,n,m)\) G A ( G Δ , n , m ) \(\le n+p(m-p)+\Delta (2n-4)\) n + p ( m - p ) + Δ ( 2 n - 4 ) , where \(p=\min \{\Delta ,\lfloor \frac{n}{2}\rfloor \}\) p = min { Δ , n 2 } . We also prove that if \(\mathcal {T}_q \subset \mathcal {Y}\) T q Y is a class of trees whose base tree has q inner vertices, then \(GA(\mathcal {T}_q,n,n-1) \le 2n+q-3\) G A ( T q , n , n - 1 ) 2 n + q - 3 . We introduce a variant of the previous notion of injection, that is, the graceful \(\mathbb {D}\) D -antimagic injection. Let G be a simple graph with diameter \({\textrm{diam}}(G)\) diam ( G ) . Suppose that \(\mathbb {D}\) D is a nonempty subset of the distance set \(\{0,1,\) { 0 , 1 , \(\ldots , {\textrm{diam}}(G)\}\) , diam ( G ) } and the \(\mathbb {D}\) D -neighborhood of a vertex v, \(N_{\mathbb {D}}(v)\) N D ( v ) , is the set of all vertices u with \(d(u,v)\in \mathbb {D}\) d ( u , v ) D . A graceful \(\mathbb {D}\) D -antimagic injection f in [0, N] is a map \(f: V(G)\rightarrow [0,N]\) f : V ( G ) [ 0 , N ] such that all induced edge labels are distinct and all \(\mathbb {D}\) D -vertex weights are also distinct, where the \(\mathbb {D}\) D -vertex weight of v is the sum of the labels of the vertices in \(N_{\mathbb {D}}(v)\) N D ( v ) . If \(\mathcal {X}\) X is a class of graphs of order n and size m such that no two vertices have the same \(\mathbb {D}\) D -neighborhood, the smallest possible N such that every graph in \(\mathcal {X}\) X has a graceful \(\mathbb {D}\) D -antimagic injection is denoted by \(G\mathbb {D}A(\mathcal {X},n,m)\) G D A ( X , n , m ) . Let the \(\mathbb {D}\) D -degree of a vertex v be the cardinality of \(N_{\mathbb {D}}(v)\) N D ( v ) . For \(\mathcal {G}_{\Delta ,\Delta _{\mathbb {D}}} \subset \mathcal {X}\) G Δ , Δ D X with a maximum degree \(\Delta \) Δ and a maximum \(\mathbb {D}\) D -degree \(\Delta _{\mathbb {D}}\) Δ D , we prove that \(G\mathbb {D}A(\mathcal {G}_{\Delta ,\Delta _{\mathbb {D}}},n,m) \le n+t(n-t)+p(m-p)\) G D A ( G Δ , Δ D , n , m ) n + t ( n - t ) + p ( m - p ) , where \(t=\min \{\lfloor \frac{n}{2}\rfloor , \Delta _{\mathbb {D}}\}\) t = min { n 2 , Δ D } and \(p=\min \{\lfloor \frac{m}{2}\rfloor ,\Delta \}\) p = min { m 2 , Δ } . Furthermore, if \(\mathcal {T}_k \subset \mathcal {X}\) T k X is a class of trees with k leaves and \(\mathbb {D}=\{1\}\) D = { 1 } , we prove that \(G\mathbb {D}A(\mathcal {T}_k,n,n-1) \le \max \{4n-6k-2, 3n-2k-3\}\) G D A ( T k , n , n - 1 ) max { 4 n - 6 k - 2 , 3 n - 2 k - 3 } . Moreover, if \(\mathcal {T}_q \subset \mathcal {X}\) T q X is a class of trees whose base tree has q inner vertices and \(\mathbb {D}=\{0,1\}\) D = { 0 , 1 } , we prove that \(G\mathbb {D}A(\mathcal {T}_q,n,n-1) \le 2n+q-3\) G D A ( T q , n , n - 1 ) 2 n + q - 3 .