No Detail Found!

Partition dimension of generalized Peterson and Harary graphs

Author(s)
Abdul Jalil M. Khalaf Department of Mathematics, Faculty of Computer Science and Mathematics University of Kufa,Najaf,Iraq
Muhammad Faisal Nadeem Department of Mathematics, COMSATS University Islamabad,Lahore Campus, Lahore 54000,Pakistan
Muhammasd Azeem Department of Aerospace Engineering, Faculty of Engineering,Universiti Putra Malaysia,Malaysia
Mohammad Reza Farahani Department of Mathematics, Iran University of Science and Technology Narmak,Tehran,Iran
Murat Cancan Faculty of Education, Van Yznc Yil University, Van, Turkey
Abstract
The distance of a connected, simple graph P is denoted by d( 1; 2); which is the length of a shortest path between the vertices 1; 2 2 V (P); where V (P) is the vertex set of P: The l-ordered partition of V (P) is K = fK1; K2; : : : ; Klg: A vertex 2 V (P); and r( jK) = fd( ; K1); d( ; K2); : : : ; d( ; Kl)g be a l-tuple distances, where r( jK) is the representation of a vertex with respect to set K: If r( jK) of is unique, for every pair of vertices, then K is the resolving partition set of V (P): The minimum number l in the resolving partition set K is known as partition dimension (pd(P)). In this paper, we studied the generalized families of Peterson graph, P ; and proved that these families have bounded partition dimension.
Publication Details
Page(s) 84-94
DOI DOI not available
Published Journal: Journal of Prime Research in Mathematics, Volume: 17, Issue: 1, Year: 2021

Request the full text from PASTIC

Keywords
Generalized Peterson graph, partition dimension, sharp bounds of partition dimension., partition resolving set, Harary Graph
0

Citations

0

Downloads

47

Views