@article{Isaac_Pandya_2022, title={On Paired Domination of Some Graphs}, volume={6}, url={https://shcpub.in/index.php/cm/article/view/306}, DOI={10.26524/cm153}, abstractNote={<div class="page" title="Page 1"> <div class="layoutArea"> <div class="column"> <p>For a graph a subset D of the vertex set is called a dominating set if every vertex in is adjacent to some vertex in D. The domination number is the minimum cardinality of a dominating set of a graph G. The paired dominating set of a graph is a dominating set and the subgraph induced by it contains a perfect matching. The paired domination number is the minimum cardinality of a paired dominating set in G. In this paper, we discuss the paired domination number of the graphs obtained by the k<sup>th</sup> power of path and cycle and degree splitting graphs of some standard graphs.</p> </div> </div> </div>}, number={2}, journal={Journal of Computational Mathematica}, author={Isaac, Rakhimol and Pandya, Parashree}, year={2022}, month={Dec.}, pages={116-120} }