The Partition Dimension of a Path Graph

Vivi Ramdhani, Fathur Rahmi

Abstract


Resolving partition is part of graph theory. This article, explains about resolving partition of the path graph, with. Given a connected graph  and  is a subset of  writen . Suppose there is , then the distance between and  is denoted in the form . There is an ordered set of -partitions of, writen then  the representation of with respect tois the  The set of partitions ofis called a resolving partition if the representation of each  to  is different. The minimum cardinality of the solving-partition to  is called the partition dimension of G which is denoted by . Before getting the partition dimension of a path graph, the first step is to look for resolving partition of the graph. Some resolving partitions of path graph,  with ,  and  are obtained. Then, the partition dimension of the path graph which is the minimum cardinality of resolving partition, namely pd (Pn)=2Resolving partition is part of graph theory. This article, explains about resolving partition of the path graph, with. Given a connected graph  and  is a subset of  writen . Suppose there is , then the distance between and  is denoted in the form . There is an ordered set of -partitions of, writen then  the representation of with respect tois the  The set of partitions ofis called a resolving partition if the representation of each  to  is different. The minimum cardinality of the solving-partition to  is called the partition dimension of G which is denoted by . Before getting the partition dimension of a path graph, the first step is to look for resolving partition of the graph. Some resolving partitionsof path graph, with ,  and  are obtained. Then, the partition dimension of the path graph which is the minimum cardinality of resolving partition, namely.

Keywords


The Partition Dimension; Path Graph; Resolving Partition.

Full Text:

PDF

References


Alfarisi, R. (2017). Dimensi Partisi dan Dimensi Partisi Bintang Graf Hasil Operasi Comb Dua Graf Terhubung. Institut Teknologi Sepuluh Nopember.

Auliya, N. (2014). Dimensi Partisi Pada Graf K_1+mC_n, dengan m,n ∈N,n≥3. UIN Maulana Malik Ibrahim.

Chartrand, G., & Lesniak, L. (1979). Graph and Digraph. Second edition. A division of Wadsworf. Inc.

Chartrand, G., & Oellermann, O. R. (1993). Applied And Algorithmic Graph Theory. United States Copyright Act.

Chartrand, G., Raines, M., & Zhang, P. (2000). The Directed Distance Dimension of Oriented Graphs.Mathematica Bohemica (2nd ed.).

Chartrand, G., Salehi, E., & Zhang, P. (2000). The Partition Dimension of a Graph. Aequationes Math (2nd ed.).

Goodaire, E. G., & Parmenter, M. M. (2002). Discrete Mathematics with Graph Theory. Prentice Hall.

Javaid, I., & Shokat, S. (2008). The partition dimension of some wheel related graphs. J. Prime Res. Math., 4(January 2008), 154–164.

Parment, M. M., & Goodaire, E. G. (2002). Discrete Mathematis with Graph Theory. Prentice-Hall, Inc.




DOI: http://dx.doi.org/10.31958/js.v13i2.4719

Refbacks

  • There are currently no refbacks.


Copyright (c) 2021 vivi ramdhani

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

Indexed by:

        

 

__________________________________________________________________________

Sainstek: Jurnal Sains dan Teknologi
ISSN 2085-8019  (print) | 2580-278x  (online)
Published by Institut Agama Islam Negeri Batusangkar

Email: sainstek@iainbatusangkar.ac.id


View Sainstek Stats

 

Creative Commons License

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