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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Mathematics and Soft Computing
Paper Title
Journal
Date
