EUVIMEDOpdag EUVIMED
Crossref

On Paired Domination of Some Graphs

Rakhimol Isaac, Parashree Pandya

Journal of Computational Mathematica · 2022-12-09 · 6 (2) · 116-120

DOI: 10.26524/cm153 ↗

At a glance

Journal article in Journal of Computational Mathematica, published online on 2022-12-09. Written by Rakhimol Isaac and 1 co-authors. Cited 1 times so far (Crossref).

AbstractBibliografiske oplysningerCiteRelated studies

Abstract (original language)

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 kth power of path and cycle and degree splitting graphs of some standard graphs.

Cite

APA

Isaac, R., & Pandya, P. (2022). On Paired Domination of Some Graphs. Journal of Computational Mathematica, 6(2), 116-120. https://doi.org/10.26524/cm153

Vancouver

Isaac R, Pandya P. On Paired Domination of Some Graphs. Journal of Computational Mathematica. 2022;6(2):116-120. doi:10.26524/cm153

BibTeX
@article{Isaac2022,
  author = {Isaac, Rakhimol and Pandya, Parashree},
  title = {On Paired Domination of Some Graphs},
  journal = {Journal of Computational Mathematica},
  year = {2022},
  volume = {6},
  number = {2},
  pages = {116--120},
  doi = {10.26524/cm153}
}
Start for free →