Distance k-domination of some path related graphs
Journal: International Journal of Mathematics and Soft Computing (Vol.4, No. 1)Publication Date: 2014-01-01
Authors : S K Vaidya; N J Kothari;
Page : 1-5
Keywords : Dominating set; domination number; distance domination; splitting graph;
Abstract
In this paper we determine the distance k-domination number for splitting graph of path as well
as the graphs obtained by duplication of a vertex by an edge and duplication of an edge by a vertex.
Other Latest Articles
- Communication Processes in the Effective Personnel Management
- Researching of Preconditions of Influence of Health’s Hocks on the Offer of Labor Market of Ukraine
- Theoretical Bases of Motivation of Professional Staff Development in Companies
- Gender Aspects of Employment in Ukraine
- The European Experience on Customs Simplifications of the Economic Operator at Transit Movement of Goods
Last modified: 2017-08-30 18:55:12