Share Your Research, Maximize Your Social Impacts
Critical graphs in total K domination
Journal: International Journal of Mathematics and Soft Computing (Vol.4, No. 1)Publication Date: 2014-01-01
Authors : D. K Thakkar; Dhaval Dinesh Kumar Pandya;
Page : 67-72
Keywords : Total K Dominating Set; minimal total K dominating set; minimum total K dominating set; Total K domination number;
Source : Download
Find it from : Google Scholar
Abstract
In this paper we study the concept of edge critical graph with respect to total K domination and the characterization of edges whose deletion or addition are responsible for the decrement or increment in the total K domination number of a graph.
Other Latest Articles
- Mathematical analysis of tip speed ratio of a wind turbine and its effects on power coefficient
- Pelvic Actinomycosis Mimicking Ovarian Cancer: A Report of 3 Cases and Review of the Literature
- Distant divisor graph of subdivision of a Graph
- The Chain is Only as Strong as its Weakest Link: Understanding the Endoscopic Optical Chain
- Algorithms to compute some dominating sets of ES (n, k) and ESC (n, k)
Last modified: 2017-08-30 18:59:48