On the K-Metro Domination Number of Triangular Ladder Graph

Abstract

A dominating set of a graph   is called Metro dominating set of  If for every pair of verities  there exists a vertex  in  such that  The K-metro domination number of triangular ladder graph ( is the order of smallest K-dominating set of  which serves as a metric set. In this paper we calculate K-metro domination number of triangular ladder graph (