Geodetic Connected Domination Number of a graph

Journal Title: JOURNAL OF ADVANCES IN MATHEMATICS - Year 2014, Vol 9, Issue 7

Abstract

A pair x, y of vertices in a nontrivial connected graph is said to geodominate a vertex v of G if either v  {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.

Authors and Affiliations

Tejaswini K M, Venkanagouda M Goudar, Venkatesh Venkatesh

Keywords

Related Articles

Best Points Selection Procedure for Estimating Location and Scatter in Multivate Data with Application to Discriminant Analysisari

Multivariate data analysis is rely on the two measures namely location and scatter. The most widely used such estimators; sample mean and covariance matrix are extremely sensitive to outliers, then the results obtained w...

Maximum likelihood Estimation for Stochastic Differential Equations with two Random Effects in the Diffusion Coefficient

We study n independent stochastic processes(xi (t),tiЄ[o,t1 ],i=1,......n) defined by a stochastic differential equation with diffusion coefficients depending nonlinearly on a random variables  and  ...

On Soft Metric Spaces

After the famous article of Moldotsove [10] in 1999 which initiate the theory of soft sets as a mathematical theory to deal  with the uncertainty problems, many research works in the softbmathematics and its applica...

MODELLING NIGERIA POPULATION GROWTH RATE

Thomas Robert Malthus Theory of population highlighted the potential dangers of over population. He stated that while the populations of the world wouldincrease in geometric proportions, the food resources available for...

Hermite Lagrange Interpolation on the Unit Circle

In this paper, we consider explicit representations and convergence of Hermite- Lagrange Interpolation on two disjoint sets of nodes, which are obtained by projecting vertically the zeros of (1- x2) Pn (?...

Download PDF file
  • EP ID EP651428
  • DOI 10.24297/jam.v9i7.2300
  • Views 170
  • Downloads 0

How To Cite

Tejaswini K M, Venkanagouda M Goudar, Venkatesh Venkatesh (2014). Geodetic Connected Domination Number of a graph. JOURNAL OF ADVANCES IN MATHEMATICS, 9(7), 2812-2816. https://europub.co.uk/articles/-A-651428