ON LOCATING-DOMINATION SET OF CARTESIAN PRODUCT GRAPHS P2
A locating-domination set is defined as a set of vertices S ? V (G) such that for every two distinct vertices u, v ? V (G) \ S, ? ?= N(u) ? S ?= N(v) ? S ?= ?. The minimum cardinality of locating-domination sets of G is called the locatingdomination number of G, denoted by ?(G). The cartesian pro...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/68830 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| id |
id-itb.:68830 |
|---|---|
| spelling |
id-itb.:688302022-09-19T11:12:47ZON LOCATING-DOMINATION SET OF CARTESIAN PRODUCT GRAPHS P2 Rizqi Az-Zukruf A.S., Ikhsan Indonesia Final Project Locating-domination set, cartesian product of graph, locatingdomination number, complete graph Kn, star graph Sn, path graph Pn, cycle graph Cn. INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/68830 A locating-domination set is defined as a set of vertices S ? V (G) such that for every two distinct vertices u, v ? V (G) \ S, ? ?= N(u) ? S ?= N(v) ? S ?= ?. The minimum cardinality of locating-domination sets of G is called the locatingdomination number of G, denoted by ?(G). The cartesian product graph G?H is a graph with vertex set V (G) × V (H) and edge set E(G?H) = {(u1, v1)(u2, v2) | u1u2 ? G, v1 = v2} ? {(u1, v1)(u2, v2) | v1v2 ? H, u1 = u2}. In this thesis, we provide the general bounds for ?(G?P2) ? n. We also show that those bounds are sharp. We will also determine the locating-domination number of a cartesian product graph G?P2 for G some special graphs. text |
| institution |
Institut Teknologi Bandung |
| building |
Institut Teknologi Bandung Library |
| continent |
Asia |
| country |
Indonesia Indonesia |
| content_provider |
Institut Teknologi Bandung |
| collection |
Digital ITB |
| language |
Indonesia |
| description |
A locating-domination set is defined as a set of vertices S ? V (G) such that for
every two distinct vertices u, v ? V (G) \ S, ? ?= N(u) ? S ?= N(v) ? S ?= ?.
The minimum cardinality of locating-domination sets of G is called the locatingdomination
number of G, denoted by ?(G). The cartesian product graph
G?H is a graph with vertex set V (G) × V (H) and edge set E(G?H) =
{(u1, v1)(u2, v2) | u1u2 ? G, v1 = v2} ? {(u1, v1)(u2, v2) | v1v2 ? H, u1 = u2}. In
this thesis, we provide the general bounds for ?(G?P2) ? n. We also show that
those bounds are sharp. We will also determine the locating-domination number of
a cartesian product graph G?P2 for G some special graphs. |
| format |
Final Project |
| author |
Rizqi Az-Zukruf A.S., Ikhsan |
| spellingShingle |
Rizqi Az-Zukruf A.S., Ikhsan ON LOCATING-DOMINATION SET OF CARTESIAN PRODUCT GRAPHS P2 |
| author_facet |
Rizqi Az-Zukruf A.S., Ikhsan |
| author_sort |
Rizqi Az-Zukruf A.S., Ikhsan |
| title |
ON LOCATING-DOMINATION SET OF CARTESIAN PRODUCT GRAPHS P2 |
| title_short |
ON LOCATING-DOMINATION SET OF CARTESIAN PRODUCT GRAPHS P2 |
| title_full |
ON LOCATING-DOMINATION SET OF CARTESIAN PRODUCT GRAPHS P2 |
| title_fullStr |
ON LOCATING-DOMINATION SET OF CARTESIAN PRODUCT GRAPHS P2 |
| title_full_unstemmed |
ON LOCATING-DOMINATION SET OF CARTESIAN PRODUCT GRAPHS P2 |
| title_sort |
on locating-domination set of cartesian product graphs p2 |
| url |
https://digilib.itb.ac.id/gdl/view/68830 |
| _version_ |
1822005867596218368 |