Geodetic Connected Domination Number of a graph

Authors

  • Tejaswini K M Sri Gauthama Research Centre
  • Venkanagouda M Goudar Sri Gauthama Research Centre
  • Venkatesh Venkatesh

DOI:

https://doi.org/10.24297/jam.v9i7.2300

Keywords:

Connected domination number, distance, diameter, Geodetic number

Abstract

A pair x, y of vertices in a nontrivial connected graph is said to geodominate a vertex v of G if either v  6.jpg{x,y} or v lies an x - y geodesic of G. A set S of vertices of G is a geodetic set if every vertex of G is geodominated by some pair of vertices of S. A subset S of vertices in a graph G is called a geodetic connected dominating set if S is both a geodetic set and a connected dominating set. We study geodetic connected domination on graphs.

Downloads

Download data is not yet available.

Author Biographies

Tejaswini K M, Sri Gauthama Research Centre

Department of Mathematics

Venkanagouda M Goudar, Sri Gauthama Research Centre

Department of Mathematics

Venkatesh Venkatesh

Department of mathematics

Downloads

Published

2014-12-19

How to Cite

K M, T., M Goudar, V., & Venkatesh, V. (2014). Geodetic Connected Domination Number of a graph. JOURNAL OF ADVANCES IN MATHEMATICS, 9(7), 2812–2816. https://doi.org/10.24297/jam.v9i7.2300

Issue

Section

Articles