Dimensi Paartisi Graf Palem

Firza, Nanda Syafira (2024) Dimensi Paartisi Graf Palem. Diploma thesis, Universitas Andalas.

	Text (Cover dan Abstrak) Abstrak.pdf - Published Version Download (256kB)
	Text (BAB 1 (PENDAHULUAN)) BAB 1.pdf - Published Version Download (167kB)
	Text (BAB 4 (KESIMPULAN)) BAB 4.pdf - Published Version Download (113kB)
	Text (DAFTAR PUSTAKA) Daftar Pustaka.pdf - Published Version Download (135kB)
	Text (SKRIPSI FULL TEXT) SKRIPSI Fulltext.pdf - Published Version Restricted to Repository staff only Download (1MB) | Request a copy

Abstract

Let G be a connected graph G. For a subset S of V (G) and a vertex v of G, the distance between v and S is defined as d(v, S) = mind(v, x) | x ∈ S. For an ordered k-partition Π = {S1, S2, · · · , Sk} of V (G) and a vertex v of G, the representation of v with respect to Π is defined as the k-vector, r(v|Π) = (d(v, S1), d(v, S2), · · · , d(v, Sk)). The partition is called a resolving partition if the k-vectors r(v|Π), v ∈ V (G), are distinct. Minimum cardinality of resolving partition Π is called as partition dimension pd(G) of G. This paper will discuss the partition dimension of palm graph CkPlSm for k ≥ 3, l, m ≥ 2.

Actions (login required)

View Item