<p>Let <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41980_2024_960_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="81" /> </InlineMediaObject> <EquationSource Format="TEX">\(G=(V,E)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>G</mi> <mo>=</mo> <mo stretchy="false">(</mo> <mi>V</mi> <mo>,</mo> <mi>E</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> be a finite simple graph and let <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41980_2024_960_Article_IEq2.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="12" /> </InlineMediaObject> <EquationSource Format="TEX">\(\Gamma \)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="normal">Γ</mi> </math></EquationSource> </InlineEquation> be an Abelian group of order |<i>V</i>|. A group distance magic labeling of <i>G</i> is a bijection <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41980_2024_960_Article_IEq3.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="88" /> </InlineMediaObject> <EquationSource Format="TEX">\(\varphi :V\longrightarrow \Gamma \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>φ</mi> <mo>:</mo> <mi>V</mi> <mo stretchy="false">⟶</mo> <mi mathvariant="normal">Γ</mi> </mrow> </math></EquationSource> </InlineEquation> with the property that there exists <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41980_2024_960_Article_IEq4.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="44" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mu \in \Gamma \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>μ</mi> <mo>∈</mo> <mi mathvariant="normal">Γ</mi> </mrow> </math></EquationSource> </InlineEquation> such that <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41980_2024_960_Article_IEq5.gif" Format="GIF" Height="23" Rendition="HTML" Resolution="72" Type="Linedraw" Width="130" /> </InlineMediaObject> <EquationSource Format="TEX">\(\sum _{v\in N(x)}\varphi (v)=\mu \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mo>∑</mo> <mrow> <mi>v</mi> <mo>∈</mo> <mi>N</mi> <mo stretchy="false">(</mo> <mi>x</mi> <mo stretchy="false">)</mo> </mrow> </msub> <mi>φ</mi> <mrow> <mo stretchy="false">(</mo> <mi>v</mi> <mo stretchy="false">)</mo> </mrow> <mo>=</mo> <mi>μ</mi> </mrow> </math></EquationSource> </InlineEquation> for any <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41980_2024_960_Article_IEq6.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="45" /> </InlineMediaObject> <EquationSource Format="TEX">\(x\in V\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>x</mi> <mo>∈</mo> <mi>V</mi> </mrow> </math></EquationSource> </InlineEquation>, where <i>N</i>(<i>x</i>) is the neighborhood of <i>x</i> and <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41980_2024_960_Article_IEq7.gif" Format="GIF" Height="12" Rendition="HTML" Resolution="72" Type="Linedraw" Width="15" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mu \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>μ</mi> </math></EquationSource> </InlineEquation> is called the magic constant of this labeling. In this paper, we give a full characterization of direct product of two cycles which admits a group distance magic labeling for any finite Abelian group. This solves two conjectures proposed in Anholcer et al., [Ars. Math. Contemp. 2015].</p>

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

Note on the Group Distance Magic Labeling of Direct Product of Two Cycles

  • Guixin Deng,
  • Zhijuan Wang,
  • ZiKang Xie,
  • Xiangneng Zeng

摘要

Let \(G=(V,E)\) G = ( V , E ) be a finite simple graph and let \(\Gamma \) Γ be an Abelian group of order |V|. A group distance magic labeling of G is a bijection \(\varphi :V\longrightarrow \Gamma \) φ : V Γ with the property that there exists \(\mu \in \Gamma \) μ Γ such that \(\sum _{v\in N(x)}\varphi (v)=\mu \) v N ( x ) φ ( v ) = μ for any \(x\in V\) x V , where N(x) is the neighborhood of x and \(\mu \) μ is called the magic constant of this labeling. In this paper, we give a full characterization of direct product of two cycles which admits a group distance magic labeling for any finite Abelian group. This solves two conjectures proposed in Anholcer et al., [Ars. Math. Contemp. 2015].