DIMENSI PARTISI BEBERAPA GRAF DENGAN DUA JEMBATAN

PUONE , THAHIRA RACHMANI (2026) DIMENSI PARTISI BEBERAPA GRAF DENGAN DUA JEMBATAN. FAKULTAS MATEMATIKA DAN ILMU PENGETAHUAN ALAM , UNIVERSITAS LAMPUNG.

[img]
Preview
File PDF
ABSTRAK.pdf

Download (2257Kb) | Preview
[img] File PDF
SKRIPSI FULL.pdf
Restricted to Hanya staf

Download (2580Kb) | Minta salinan
[img]
Preview
File PDF
SKRIPSI TANPA BAB PEMBAHASAN.pdf

Download (2582Kb) | Preview

Abstrak (Berisi Bastraknya saja, Judul dan Nama Tidak Boleh di Masukan)

Misalkan G } dari himpunan titik V u ke partisi L, dinotasikan dengan d(u, L), didefinisikan dengan min{d(u, l 1 ∈ L}. Vektor d((u, L 1 ), d(u, L 2 ), ..., d(u, L k , L )) merupakan representasi dari titik u ke himpunan partisi Π, dinotasikan dengan r Kata-kata kunci: 2 , ..., L k i |l i ABSTRACT Let G } of the vertex set V u to a partition L, denoted by d(u, L), is defined as d(u, L) = min{d(u, l 1 , L 2 ∈ L}. The vector (d(u, L )) is called the representation of the vertex u with respect to the partition Π, denoted by r 1 ), d(u, L 2 ), . . . , d(u, L k , . . . , L k of subsets in such a partition is called the partition dimension of the graph G, denoted by pd(G). In this research, we study the partition dimension of graphs with two bridges formed by connecting two graphs through two new edges. The focus of this study is on double bridge graphs constructed from several pairs of graphs, namely path graphs, cycle graphs, star graphs, complete graphs, and rose graphs. For each pair of graphs, the exact value of the partition dimension is determined, as well as a lower bound for the partition dimension of a graph formed from arbitrary graphs. Keywords: k i ) i

Jenis Karya Akhir: Skripsi
Subyek: 500 ilmu pengetahuan alam dan matematika > 510 Matematika
Program Studi: FAKULTAS MATEMATIKA DAN ILMU PENGETAHUAN ALAM (FMIPA) > Prodi S1 Matematika
Pengguna Deposit: 2602433583 Digilib
Date Deposited: 12 Feb 2026 07:53
Terakhir diubah: 12 Feb 2026 07:53
URI: http://digilib.unila.ac.id/id/eprint/96275

Actions (login required)

Lihat Karya Akhir Lihat Karya Akhir