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...
Saved in:
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 |
Similar Items
-
The endomorphism monoids of (n − 3)-regular graphs of order n
by: Nirutt Pipattanajinda, et al.
Published: (2018) -
The endomorphism monoids of (n − 3)-regular graphs of order n
by: Pipattanajinda N., et al.
Published: (2017) -
DOMINATION AND PERFECT DOMINATION IN K-REGULAR BIPARTITE GRAPHS
by: LOY SUAN HUI
Published: (2021) -
ON THE METRIC DIMENSION OF REGULAR AND COMPOSITION GRAPHS AND CHARACTERIZATION OF ALL GRAPHS OF ORDER N WITH METRIC DIMENSION N-3
by: WIDO SAPUTRO (NIM: 30107007); Tim Pembimbing: Prof. Dr. Edy Tri Baskoro, Prof. Dr. M. Salman , SUHADI -
On the clique number of a strongly regular graph
by: Greaves, Gary Royden Watson, et al.
Published: (2021)