We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
ON RADIUS DOMINATION IN GRAPHS.
- Authors
NANJUNDASWAMY, M.; NAYAKA, S. R.; PUTTASWAMY; KOTA REDDY, P. SIVA; RAJU, S.
- Abstract
A dominating set S in a graph G is called a radius dominating set if for each vertex V ∈ v -- S there is at least one vertex in u ∈ S S such that d(u, v) = rad(G). The cardinality of the minimum radius dominating set is called the radius domination number of G, denoted by γrd(G). In this article, we study the properties of this parameter. The radius domination number of some families of standard graphs are obtained and the bounds are estimated.
- Subjects
GRAPHIC methods; GEOMETRIC vertices; RADIUS (Geometry); GEOMETRY; MATHEMATICS
- Publication
Global & Stochastic Analysis, 2024, Vol 11, Issue 2, p68
- ISSN
2248-9444
- Publication type
Article