| Home

Overview


Original Research

SUBDIVISION NUMBER OF SPLIT POINT SET DOMINATION OF A GRAPH

Dr. T. BRINDHA

Vol 18, No 04 ( 2023 )   |  DOI: 10.17605/OSF.IO/Z4WKG   |   Author Affiliation: Associate Professor, Department of Mathematics, PSGR Krishnammal College for Women, Coimbatore. Tamilnadu, India.   |   Licensing: CC 4.0   |   Pg no: 625-630   |   Published on: 17-04-2023

Abstract

Let G= (V,E) be a connected, nontrivial, simple, finite graph. In this paper a new parameter called subdivision split point set domination is introduced and is defined by a set D of vertices in a graph G is a subdivision point set domination, if (i) The graph obtained from a graph G by subdividing each edge of G exactly once (ii) For every set S⊆ V-D such that v∈ D, that is is connected. (iii) The induced sub graph is disconnected. The minimum cardinality of subdivision split point set dominating set is denoted by gsp (S (G)). Besides some bounds, exact values of gsp(S (G)) are determined. Some theorems based on split point Set Domination are also discussed


Keywords

Domination Number, Split domination number, Point set domination number, Subdivision number of split point set domination number