A Note On The Partition Dimension of Thorn of Fan Graph

Let be a connected graph and. For a vertex and an ordered k-partition of, the presentation of concerning is the k-vector, where denotes the distance between and for. The k-partition is said to be resolving if for every two vertices, the representation. The minimum k for which there is a resolving k-...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autor principal:	Auli Mardhaningsih
Formato:	article
Lenguaje:	EN
Publicado:	Department of Mathematics, UIN Sunan Ampel Surabaya 2019
Materias:	Resolving partition; Partition dimension; Fan; Thorn graph Mathematics QA1-939
Acceso en línea:	https://doaj.org/article/486b66570c3940ae939e199c1f902486
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:486b66570c3940ae939e199c1f902486
record_format	dspace
spelling	oai:doaj.org-article:486b66570c3940ae939e199c1f9024862021-12-02T15:39:29ZA Note On The Partition Dimension of Thorn of Fan Graph2527-31592527-316710.15642/mantik.2019.5.1.45-49https://doaj.org/article/486b66570c3940ae939e199c1f9024862019-05-01T00:00:00Zhttp://jurnalsaintek.uinsby.ac.id/index.php/mantik/article/view/512https://doaj.org/toc/2527-3159https://doaj.org/toc/2527-3167Let be a connected graph and. For a vertex and an ordered k-partition of, the presentation of concerning is the k-vector, where denotes the distance between and for. The k-partition is said to be resolving if for every two vertices, the representation. The minimum k for which there is a resolving k-partition of is called the partition dimension of, denoted by. Let be a non-negative integer, for. The thorn of, with parameters is obtained by attaching vertices of degree one to the vertex, denoted by. In this paper, we determine the partition dimension of where, the fan on n+1 vertices, for.Auli MardhaningsihDepartment of Mathematics, UIN Sunan Ampel SurabayaarticleResolving partition; Partition dimension; Fan; Thorn graphMathematicsQA1-939ENMantik: Jurnal Matematika, Vol 5, Iss 1, Pp 45-49 (2019)
institution	DOAJ
collection	DOAJ
language	EN
topic	Resolving partition; Partition dimension; Fan; Thorn graph Mathematics QA1-939
spellingShingle	Resolving partition; Partition dimension; Fan; Thorn graph Mathematics QA1-939 Auli Mardhaningsih A Note On The Partition Dimension of Thorn of Fan Graph
description	Let be a connected graph and. For a vertex and an ordered k-partition of, the presentation of concerning is the k-vector, where denotes the distance between and for. The k-partition is said to be resolving if for every two vertices, the representation. The minimum k for which there is a resolving k-partition of is called the partition dimension of, denoted by. Let be a non-negative integer, for. The thorn of, with parameters is obtained by attaching vertices of degree one to the vertex, denoted by. In this paper, we determine the partition dimension of where, the fan on n+1 vertices, for.
format	article
author	Auli Mardhaningsih
author_facet	Auli Mardhaningsih
author_sort	Auli Mardhaningsih
title	A Note On The Partition Dimension of Thorn of Fan Graph
title_short	A Note On The Partition Dimension of Thorn of Fan Graph
title_full	A Note On The Partition Dimension of Thorn of Fan Graph
title_fullStr	A Note On The Partition Dimension of Thorn of Fan Graph
title_full_unstemmed	A Note On The Partition Dimension of Thorn of Fan Graph
title_sort	note on the partition dimension of thorn of fan graph
publisher	Department of Mathematics, UIN Sunan Ampel Surabaya
publishDate	2019
url	https://doaj.org/article/486b66570c3940ae939e199c1f902486
work_keys_str_mv	AT aulimardhaningsih anoteonthepartitiondimensionofthornoffangraph AT aulimardhaningsih noteonthepartitiondimensionofthornoffangraph
_version_	1718385870638153728

A Note On The Partition Dimension of Thorn of Fan Graph

Ejemplares similares