Geodetic Domination in Graphs

Escuadro, H.; Gera, R.; Hansberg, A.; Rad, N. Jafari; Volkmann, L.

Abstract

References

Journal of Combinatorial Mathematics and Combinatorial Computing

Volume 077
Pages: 89-101

Research article

Geodetic Domination in Graphs

^¹, ^², ^³, ^⁴, ^³

¹Department of Mathematics, Juniata College Huntingdon, PA 16652

²Department of Applied Mathematics, Naval Postgraduate School, Monterey, CA 93943

³Lehrstuhl II fiir Mathematik, RWTH Aachen University, 52056 Aachen, Germany; hansberg

⁴Department: of Mathematics, Shahrood University of Technology Shahrood, Iran

Published: 31/05/2010

Download PDF
Cite

Copyright Link
License

Abstract

A subset $S$ of vertices in a graph $G$ is called a $g e o d e t i c d o m i n a t i n g s e t$ 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

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

Geodetic Domination in Graphs

Abstract

Information

Guidelines

CP Initiatives

Follow CP