LOCATING-DOMINATING NUMBER IN (n−2)-REGULAR GRAPH AND (n−3)-REGULAR GRAPH

Let G = (V,E) be a connected graph with vertex set V and the edge set E. Let W ⊆ V (G) is called a locating-dominating set for G if for every two distinct elements u,v ∈ V (G) W, we have ∅ 6= N(u) ∩ W 6= N(v) ∩ W 6= ∅. The locating-dominat...

Full description

Saved in:

Bibliographic Details
Main Author:	KADIR ABDUL GAFUR (NIM: 90113005), ANUWAR
Format:	Theses
Language:	Indonesia
Online Access:	https://digilib.itb.ac.id/gdl/view/21175
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	Institut Teknologi Bandung
Language:	Indonesia

id	id-itb.:21175
spelling	id-itb.:211752017-12-19T17:05:54ZLOCATING-DOMINATING NUMBER IN (n−2)-REGULAR GRAPH AND (n−3)-REGULAR GRAPH KADIR ABDUL GAFUR (NIM: 90113005), ANUWAR Indonesia Theses INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/21175 Let G = (V,E) be a connected graph with vertex set V and the edge set E. Let W ⊆ V (G) is called a locating-dominating set for G if for every two distinct elements u,v ∈ V (G) W, we have ∅ 6= N(u) ∩ W 6= N(v) ∩ W 6= ∅. The locating-dominating number, denoted by λ(G), is the minimum cardinality of a locating-dominating set of G. <br /> <br /> The graph G is called k-regular, if every vertex of G is adjacent to k other vertices. Ignacio <br /> <br /> M. Pelayo (2012) have determined of locating-dominating number of k-regular graph of order n with k = 2 or k = n−1. In this project, we determine the locating-dominating number of (n−2)-regular graph with n ≥ 4 and (n−3)-regular graph with n ≥ 5. <br /> 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	Let G = (V,E) be a connected graph with vertex set V and the edge set E. Let W ⊆ V (G) is called a locating-dominating set for G if for every two distinct elements u,v ∈ V (G) W, we have ∅ 6= N(u) ∩ W 6= N(v) ∩ W 6= ∅. The locating-dominating number, denoted by λ(G), is the minimum cardinality of a locating-dominating set of G. <br /> <br /> The graph G is called k-regular, if every vertex of G is adjacent to k other vertices. Ignacio <br /> <br /> M. Pelayo (2012) have determined of locating-dominating number of k-regular graph of order n with k = 2 or k = n−1. In this project, we determine the locating-dominating number of (n−2)-regular graph with n ≥ 4 and (n−3)-regular graph with n ≥ 5. <br />
format	Theses
author	KADIR ABDUL GAFUR (NIM: 90113005), ANUWAR
spellingShingle	KADIR ABDUL GAFUR (NIM: 90113005), ANUWAR LOCATING-DOMINATING NUMBER IN (n−2)-REGULAR GRAPH AND (n−3)-REGULAR GRAPH
author_facet	KADIR ABDUL GAFUR (NIM: 90113005), ANUWAR
author_sort	KADIR ABDUL GAFUR (NIM: 90113005), ANUWAR
title	LOCATING-DOMINATING NUMBER IN (n−2)-REGULAR GRAPH AND (n−3)-REGULAR GRAPH
title_short	LOCATING-DOMINATING NUMBER IN (n−2)-REGULAR GRAPH AND (n−3)-REGULAR GRAPH
title_full	LOCATING-DOMINATING NUMBER IN (n−2)-REGULAR GRAPH AND (n−3)-REGULAR GRAPH
title_fullStr	LOCATING-DOMINATING NUMBER IN (n−2)-REGULAR GRAPH AND (n−3)-REGULAR GRAPH
title_full_unstemmed	LOCATING-DOMINATING NUMBER IN (n−2)-REGULAR GRAPH AND (n−3)-REGULAR GRAPH
title_sort	locating-dominating number in (n−2)-regular graph and (n−3)-regular graph
url	https://digilib.itb.ac.id/gdl/view/21175
_version_	1821120383013617664

LOCATING-DOMINATING NUMBER IN (n&#8722;2)-REGULAR GRAPH AND (n&#8722;3)-REGULAR GRAPH

Similar Items

LOCATING-DOMINATING NUMBER IN (n−2)-REGULAR GRAPH AND (n−3)-REGULAR GRAPH