@Article{Mojdeh2007,
author = "Mojdeh, Doost Ali and Rad, Nader Jafari",
title = "k-perfect geodominating sets in graphs",
journal = "Opuscula Math.",
year = "2007",
volume = "27",
number = "1",
pages = "51--57",
doi = "http://dx.doi.org/10.7494/OpMath.2007.27.1.51",
url = "http://dx.doi.org/10.7494/OpMath.2007.27.1.51",
abstract = "A perfect geodominating set in a graph \(G\) is a geodominating set \(S\) such that any vertex \(v \in V(G)\setminus S\) is geodominated by exactly one pair of vertices of \(S\). A \(k\)-perfect geodominating set is a geodominating set \(S\) such that any vertex \(v \in V(G)\setminus S\) is geodominated by exactly one pair \(x\), \(y\) of vertices of \(S\) with \(d(x,y)=k\). We study perfect and \(k\)-perfect geodomination numbers of a graph \(G\).",
keywords = "geodominating set, perfect geodomination number, pendant vertex, pendant edge",
issn = "1232-9274"
}