# A Note On The Partition Dimension of Thorn of Fan Graph

### Abstract

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.

### Downloads

### References

G. Chartrand, S. E, and Z. P, "The Partition dimension of a graph," Aequationes Math, pp. 45-54, 2000.

J. A. Bondy and U. Murty, Graph Theory with Applications, London, 1976.

A. "Partition dimension of amalgamation," Bulletin of Mathematics, pp. 161-167, 2012.

A. Kirlangic, "The Scattering number of thorn graph," International Journal of computer math, pp. 299-311, 2004.

E. Baskoro and D., "The partition dimension of corona product of two graphs," Far East J. Math. Sci, pp. 181-196, 2012.

N. L. Biggs, R. Lloyd and R. Wilson, Graph theory, Oxford: 1736-1936, 1986.

G. Chartrand and S. E, "On partition dimension of a graph," Congr. number, pp. 157-168, 1998.

E. Rahimah, L. Yulianti, and D. Welyyanti, "Penentuan Bilangan Kromatik Lokasi Graf Thorn dari Graf Roda W3," Jurnal Matematika UNAND, Vol. VII, No. 4, pp. 1-8, .

J. Gross and J. Yellen, Graph theory and its applications (Second Edition), New York, 2006.

I. Gutman, "Distance in Thorny Graph," Publ.Ins.Math, pp. 31-36, 1998.

D. O. Haryeni, E. T. Baskoro, and S. W. Saputro, "On the partition dimension of disconnected graphs," 2017.

A. Juan, V. Rodriguez and L. Magdalena, "On the partition dimension of trees," discrete applied mathematics, pp. 204-209, 2014.

E. Lloyd, J. Bondy and U. Murt, "Graph theory with apllication," the mathematical gazette, pp. 62-63, 2007.

R. Munir, Matematika Diskrit, Bandung, 2003.

I. Tomescu, I. Javaid and S. , "On the Partition Dimension and Conected Partition dimension of wheels," Ars Combinatoria, pp. 311-317, 2007.

I. Tomescu, "Discrepancies between metric dimension of a connected graph," Discrete Math, pp. 5026-5031, 2008.

*Jurnal Matematika "MANTIK"*,

*5*(1), 45-49. https://doi.org/10.15642/mantik.2019.5.1.45-49

Copyright (c) 2019 Auli Mardhaningsih

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

*Authors who publish with this journal agree to the following terms:*

*Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.**Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.**Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work*