Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Geodetic Domination in Graphs

H. Escuadro1, R. Gera2, A. Hansberg3, N. Jafari Rad4, L. Volkmann3
1Department of Mathematics, Juniata College Huntingdon, PA 16652
2Department of Applied Mathematics, Naval Postgraduate School, Monterey, CA 93943
3Lehrstuhl II fiir Mathematik, RWTH Aachen University, 52056 Aachen, Germany; hansberg
4Department: of Mathematics, Shahrood University of Technology Shahrood, Iran
  • Published: 31/05/2010

Abstract

A subset \(S\) of vertices in a graph \(G\) is called a \({geodetic\; dominating\; set}\) if \(S\) is both a geodetic set and a (standard) dominating set. In this paper, we study geodetic domination on graphs.

Keywords: Domination; geodesic; geodetic 2000 Mathematical subject classification: 05C12, 05C69
Citation
H. Escuadro, R. Gera, A. Hansberg, N. Jafari Rad, L. Volkmann. Geodetic Domination in Graphs[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 077. 89-101. .