On Minimal Geodetic Domination in Graphs

Hearty M. Nuenay, and Ferdinand P. Jamil. "On Minimal Geodetic Domination in Graphs." Discussiones Mathematicae Graph Theory 35.3 (2015): 403-418. <http://eudml.org/doc/271213>.

@article{HeartyM2015,
abstract = {Let G be a connected graph. For two vertices u and v in G, a u-v geodesic is any shortest path joining u and v. The closed geodetic interval IG[u, v] consists of all vertices of G lying on any u-v geodesic. For S ⊆ V (G), S is a geodetic set in G if ∪u,v∈S IG[u, v] = V (G). Vertices u and v of G are neighbors if u and v are adjacent. The closed neighborhood NG[v] of vertex v consists of v and all neighbors of v. For S ⊆ V (G), S is a dominating set in G if ∪u∈S NG[u] = V (G). A geodetic dominating set in G is any geodetic set in G which is at the same time a dominating set in G. A geodetic dominating set in G is a minimal geodetic dominating set if it does not have a proper subset which is itself a geodetic dominating set in G. The maximum cardinality of a minimal geodetic dom- inating set in G is the upper geodetic domination number of G. This paper initiates the study of minimal geodetic dominating sets and upper geodetic domination numbers of connected graphs.},
author = {Hearty M. Nuenay, Ferdinand P. Jamil},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {minimal geodetic dominating set; upper geodetic domination number},
language = {eng},
number = {3},
pages = {403-418},
title = {On Minimal Geodetic Domination in Graphs},
url = {http://eudml.org/doc/271213},
volume = {35},
year = {2015},
}

TY - JOUR
AU - Hearty M. Nuenay
AU - Ferdinand P. Jamil
TI - On Minimal Geodetic Domination in Graphs
JO - Discussiones Mathematicae Graph Theory
PY - 2015
VL - 35
IS - 3
SP - 403
EP - 418
AB - Let G be a connected graph. For two vertices u and v in G, a u-v geodesic is any shortest path joining u and v. The closed geodetic interval IG[u, v] consists of all vertices of G lying on any u-v geodesic. For S ⊆ V (G), S is a geodetic set in G if ∪u,v∈S IG[u, v] = V (G). Vertices u and v of G are neighbors if u and v are adjacent. The closed neighborhood NG[v] of vertex v consists of v and all neighbors of v. For S ⊆ V (G), S is a dominating set in G if ∪u∈S NG[u] = V (G). A geodetic dominating set in G is any geodetic set in G which is at the same time a dominating set in G. A geodetic dominating set in G is a minimal geodetic dominating set if it does not have a proper subset which is itself a geodetic dominating set in G. The maximum cardinality of a minimal geodetic dom- inating set in G is the upper geodetic domination number of G. This paper initiates the study of minimal geodetic dominating sets and upper geodetic domination numbers of connected graphs.
LA - eng
KW - minimal geodetic dominating set; upper geodetic domination number
UR - http://eudml.org/doc/271213
ER -