Another Antimagic Conjecture

An antimagic labeling of a graph <i>G</i> is a bijection <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>f</mi><mo>:</mo><mi>E</mi><mo stretchy="...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Rinovia Simanjuntak, Tamaro Nadeak, Fuad Yasin, Kristiana Wijaya, Nurdin Hinding, Kiki Ariyanti Sugeng
Formato:	article
Lenguaje:	EN
Publicado:	MDPI AG 2021
Materias:	antimagic labeling <i>D</i>-antimagic labeling Mathematics QA1-939
Acceso en línea:	https://doaj.org/article/fe2912b6e6bc4431a5b5750faee174b3
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:fe2912b6e6bc4431a5b5750faee174b3
record_format	dspace
institution	DOAJ
collection	DOAJ
language	EN
topic	antimagic labeling <i>D</i>-antimagic labeling Mathematics QA1-939
spellingShingle	antimagic labeling <i>D</i>-antimagic labeling Mathematics QA1-939 Rinovia Simanjuntak Tamaro Nadeak Fuad Yasin Kristiana Wijaya Nurdin Hinding Kiki Ariyanti Sugeng Another Antimagic Conjecture
description	An antimagic labeling of a graph <i>G</i> is a bijection <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>f</mi><mo>:</mo><mi>E</mi><mo stretchy="false">(</mo><mi>G</mi><mo stretchy="false">)</mo><mo>→</mo><mo>{</mo><mn>1</mn><mo>,</mo><mo>…</mo><mo>,</mo><mo>\|</mo><mi>E</mi><mo stretchy="false">(</mo><mi>G</mi><mo stretchy="false">)</mo><mo>\|</mo><mo>}</mo></mrow></semantics></math></inline-formula> such that the weights <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>w</mi><mrow><mo stretchy="false">(</mo><mi>x</mi><mo stretchy="false">)</mo></mrow><mo>=</mo><msub><mo>∑</mo><mrow><mi>y</mi><mo>∼</mo><mi>x</mi></mrow></msub><mi>f</mi><mrow><mo stretchy="false">(</mo><mi>y</mi><mo stretchy="false">)</mo></mrow></mrow></semantics></math></inline-formula> distinguish all vertices. A well-known conjecture of Hartsfield and Ringel (1990) is that every connected graph other than <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msub><mi>K</mi><mn>2</mn></msub></semantics></math></inline-formula> admits an antimagic labeling. For a set of distances <i>D</i>, a <i>D</i>-antimagic labeling of a graph <i>G</i> is a bijection <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>f</mi><mo>:</mo><mi>V</mi><mo stretchy="false">(</mo><mi>G</mi><mo stretchy="false">)</mo><mo>→</mo><mo>{</mo><mn>1</mn><mo>,</mo><mo>…</mo><mo>,</mo><mo>\|</mo><mi>V</mi><mo stretchy="false">(</mo><mi>G</mi><mo stretchy="false">)</mo><mo>\|</mo><mo>}</mo></mrow></semantics></math></inline-formula> such that the <i>weight</i><inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>ω</mi><mrow><mo stretchy="false">(</mo><mi>x</mi><mo stretchy="false">)</mo></mrow><mo>=</mo><msub><mo>∑</mo><mrow><mi>y</mi><mo>∈</mo><msub><mi>N</mi><mi>D</mi></msub><mrow><mo stretchy="false">(</mo><mi>x</mi><mo stretchy="false">)</mo></mrow></mrow></msub><mi>f</mi><mrow><mo stretchy="false">(</mo><mi>y</mi><mo stretchy="false">)</mo></mrow></mrow></semantics></math></inline-formula> is distinct for each vertex <i>x</i>, where <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>N</mi><mi>D</mi></msub><mrow><mo stretchy="false">(</mo><mi>x</mi><mo stretchy="false">)</mo></mrow><mo>=</mo><mrow><mo>{</mo><mi>y</mi><mo>∈</mo><mi>V</mi><mrow><mo stretchy="false">(</mo><mi>G</mi><mo stretchy="false">)</mo></mrow><mo>\|</mo><mi>d</mi><mrow><mo stretchy="false">(</mo><mi>x</mi><mo>,</mo><mi>y</mi><mo stretchy="false">)</mo></mrow><mo>∈</mo><mi>D</mi><mo>}</mo></mrow></mrow></semantics></math></inline-formula> is the <i>D</i>-neigbourhood set of a vertex <i>x</i>. If <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>N</mi><mi>D</mi></msub><mrow><mo stretchy="false">(</mo><mi>x</mi><mo stretchy="false">)</mo></mrow><mo>=</mo><mi>r</mi></mrow></semantics></math></inline-formula>, for every vertex <i>x</i> in <i>G</i>, a graph <i>G</i> is said to be <i><inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo stretchy="false">(</mo><mi>D</mi><mo>,</mo><mi>r</mi><mo stretchy="false">)</mo></mrow></semantics></math></inline-formula>-regular</i>. In this paper, we conjecture that a graph admits a <i>D</i>-antimagic labeling if and only if it does not contain two vertices having the same <i>D</i>-neighborhood set. We also provide evidence that the conjecture is true. We present computational results that, for <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>D</mi><mo>=</mo><mo>{</mo><mn>1</mn><mo>}</mo></mrow></semantics></math></inline-formula>, all graphs of order up to 8 concur with the conjecture. We prove that the set of <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo stretchy="false">(</mo><mi>D</mi><mo>,</mo><mi>r</mi><mo stretchy="false">)</mo></mrow></semantics></math></inline-formula>-regular <i>D</i>-antimagic graphs is closed under union. We provide examples of disjoint union of symmetric <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo stretchy="false">(</mo><mi>D</mi><mo>,</mo><mi>r</mi><mo stretchy="false">)</mo></mrow></semantics></math></inline-formula>-regular that are <i>D</i>-antimagic and examples of disjoint union of non-symmetric non-<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo stretchy="false">(</mo><mi>D</mi><mo>,</mo><mi>r</mi><mo stretchy="false">)</mo></mrow></semantics></math></inline-formula>-regular graphs that are <i>D</i>-antimagic. Furthermore, lastly, we show that it is possible to obtain a <i>D</i>-antimagic graph from a previously known distance antimagic graph.
format	article
author	Rinovia Simanjuntak Tamaro Nadeak Fuad Yasin Kristiana Wijaya Nurdin Hinding Kiki Ariyanti Sugeng
author_facet	Rinovia Simanjuntak Tamaro Nadeak Fuad Yasin Kristiana Wijaya Nurdin Hinding Kiki Ariyanti Sugeng
author_sort	Rinovia Simanjuntak
title	Another Antimagic Conjecture
title_short	Another Antimagic Conjecture
title_full	Another Antimagic Conjecture
title_fullStr	Another Antimagic Conjecture
title_full_unstemmed	Another Antimagic Conjecture
title_sort	another antimagic conjecture
publisher	MDPI AG
publishDate	2021
url	https://doaj.org/article/fe2912b6e6bc4431a5b5750faee174b3
work_keys_str_mv	AT rinoviasimanjuntak anotherantimagicconjecture AT tamaronadeak anotherantimagicconjecture AT fuadyasin anotherantimagicconjecture AT kristianawijaya anotherantimagicconjecture AT nurdinhinding anotherantimagicconjecture AT kikiariyantisugeng anotherantimagicconjecture
_version_	1718410318706638848
spelling	oai:doaj.org-article:fe2912b6e6bc4431a5b5750faee174b32021-11-25T19:06:30ZAnother Antimagic Conjecture10.3390/sym131120712073-8994https://doaj.org/article/fe2912b6e6bc4431a5b5750faee174b32021-11-01T00:00:00Zhttps://www.mdpi.com/2073-8994/13/11/2071https://doaj.org/toc/2073-8994An antimagic labeling of a graph <i>G</i> is a bijection <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>f</mi><mo>:</mo><mi>E</mi><mo stretchy="false">(</mo><mi>G</mi><mo stretchy="false">)</mo><mo>→</mo><mo>{</mo><mn>1</mn><mo>,</mo><mo>…</mo><mo>,</mo><mo>\|</mo><mi>E</mi><mo stretchy="false">(</mo><mi>G</mi><mo stretchy="false">)</mo><mo>\|</mo><mo>}</mo></mrow></semantics></math></inline-formula> such that the weights <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>w</mi><mrow><mo stretchy="false">(</mo><mi>x</mi><mo stretchy="false">)</mo></mrow><mo>=</mo><msub><mo>∑</mo><mrow><mi>y</mi><mo>∼</mo><mi>x</mi></mrow></msub><mi>f</mi><mrow><mo stretchy="false">(</mo><mi>y</mi><mo stretchy="false">)</mo></mrow></mrow></semantics></math></inline-formula> distinguish all vertices. A well-known conjecture of Hartsfield and Ringel (1990) is that every connected graph other than <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msub><mi>K</mi><mn>2</mn></msub></semantics></math></inline-formula> admits an antimagic labeling. For a set of distances <i>D</i>, a <i>D</i>-antimagic labeling of a graph <i>G</i> is a bijection <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>f</mi><mo>:</mo><mi>V</mi><mo stretchy="false">(</mo><mi>G</mi><mo stretchy="false">)</mo><mo>→</mo><mo>{</mo><mn>1</mn><mo>,</mo><mo>…</mo><mo>,</mo><mo>\|</mo><mi>V</mi><mo stretchy="false">(</mo><mi>G</mi><mo stretchy="false">)</mo><mo>\|</mo><mo>}</mo></mrow></semantics></math></inline-formula> such that the <i>weight</i><inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>ω</mi><mrow><mo stretchy="false">(</mo><mi>x</mi><mo stretchy="false">)</mo></mrow><mo>=</mo><msub><mo>∑</mo><mrow><mi>y</mi><mo>∈</mo><msub><mi>N</mi><mi>D</mi></msub><mrow><mo stretchy="false">(</mo><mi>x</mi><mo stretchy="false">)</mo></mrow></mrow></msub><mi>f</mi><mrow><mo stretchy="false">(</mo><mi>y</mi><mo stretchy="false">)</mo></mrow></mrow></semantics></math></inline-formula> is distinct for each vertex <i>x</i>, where <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>N</mi><mi>D</mi></msub><mrow><mo stretchy="false">(</mo><mi>x</mi><mo stretchy="false">)</mo></mrow><mo>=</mo><mrow><mo>{</mo><mi>y</mi><mo>∈</mo><mi>V</mi><mrow><mo stretchy="false">(</mo><mi>G</mi><mo stretchy="false">)</mo></mrow><mo>\|</mo><mi>d</mi><mrow><mo stretchy="false">(</mo><mi>x</mi><mo>,</mo><mi>y</mi><mo stretchy="false">)</mo></mrow><mo>∈</mo><mi>D</mi><mo>}</mo></mrow></mrow></semantics></math></inline-formula> is the <i>D</i>-neigbourhood set of a vertex <i>x</i>. If <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>N</mi><mi>D</mi></msub><mrow><mo stretchy="false">(</mo><mi>x</mi><mo stretchy="false">)</mo></mrow><mo>=</mo><mi>r</mi></mrow></semantics></math></inline-formula>, for every vertex <i>x</i> in <i>G</i>, a graph <i>G</i> is said to be <i><inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo stretchy="false">(</mo><mi>D</mi><mo>,</mo><mi>r</mi><mo stretchy="false">)</mo></mrow></semantics></math></inline-formula>-regular</i>. In this paper, we conjecture that a graph admits a <i>D</i>-antimagic labeling if and only if it does not contain two vertices having the same <i>D</i>-neighborhood set. We also provide evidence that the conjecture is true. We present computational results that, for <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>D</mi><mo>=</mo><mo>{</mo><mn>1</mn><mo>}</mo></mrow></semantics></math></inline-formula>, all graphs of order up to 8 concur with the conjecture. We prove that the set of <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo stretchy="false">(</mo><mi>D</mi><mo>,</mo><mi>r</mi><mo stretchy="false">)</mo></mrow></semantics></math></inline-formula>-regular <i>D</i>-antimagic graphs is closed under union. We provide examples of disjoint union of symmetric <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo stretchy="false">(</mo><mi>D</mi><mo>,</mo><mi>r</mi><mo stretchy="false">)</mo></mrow></semantics></math></inline-formula>-regular that are <i>D</i>-antimagic and examples of disjoint union of non-symmetric non-<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo stretchy="false">(</mo><mi>D</mi><mo>,</mo><mi>r</mi><mo stretchy="false">)</mo></mrow></semantics></math></inline-formula>-regular graphs that are <i>D</i>-antimagic. Furthermore, lastly, we show that it is possible to obtain a <i>D</i>-antimagic graph from a previously known distance antimagic graph.Rinovia SimanjuntakTamaro NadeakFuad YasinKristiana WijayaNurdin HindingKiki Ariyanti SugengMDPI AGarticleantimagic labeling<i>D</i>-antimagic labelingMathematicsQA1-939ENSymmetry, Vol 13, Iss 2071, p 2071 (2021)

Another Antimagic Conjecture

Ejemplares similares