BAREKENG: Jurnal Ilmu Matematika dan Terapan
Vol 19 No 2 (2025): BAREKENG: Journal of Mathematics and Its Application

THE PARTITION DIMENSION OF CYCLE BOOKS GRAPH B_(m,n) WITH A COMMON PATH P_2

Santoso, Jaya (Unknown)
Darmaji, Darmaji (Unknown)

Article Info

Publish Date
01 Apr 2025

Abstract

Suppose is a connected graph with elements of a set of vertices denoted by and a subset of . The distance between and is the shortest distance to every vertex in . Let be a partition of , where each subset belongs to . The representation of a vertex with respect to is defined as the set of distances from to each vertex in . If each representation of each vertex of is different, then the partition is called the resolving partition of , and the partition dimension is the smallest integer such that has a resolving partition with members. In this research, we show the partition dimensions of the cycle books graph . Cycle books graph is a graph consisting of copies of a cycle with a common path . The partition dimension of the cycle books graph for and is shown.

Copyrights © 2025




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
BAREKENG: Jurnal Ilmu Matematika dan Terapan
Website

Abbrev

barekeng

Publisher

Universitas Pattimura

Subject

Computer Science & IT Control & Systems Engineering Economics, Econometrics & Finance Energy Engineering Mathematics Mechanical Engineering Physics Transportation

Description

BAREKENG: Jurnal ilmu Matematika dan Terapan is one of the scientific publication media, which publish the article related to the result of research or study in the field of Pure Mathematics and Applied Mathematics. Focus and scope of BAREKENG: Jurnal ilmu Matematika dan Terapan, as follows: - Pure ...