EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Characterizing the $\mathcal{SMP}$ Domination Number of k-Power Graphs

G. Mahadevan, L. Praveenkumar, C. Sivagnanam, S. Vijayalakshmi

Boletim da Sociedade Paranaense de Matemática · 28.10.2026 · 44 (14) · 1-10

DOI: 10.5269/bspm.85878 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Boletim da Sociedade Paranaense de Matemática, online erschienen am 28.10.2026. Verfasst von G. Mahadevan und 3 weiteren Autor:innen. Die Arbeit nennt 17 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

A dominating set $D$ of a graph is called a $\mathcal{SMP}$- dominating set if every vertex in $\langle D \rangle$ is either a pendant vertex or a support vertex and every vertex $u \in V - D$ satisfies the condition that $|N(u) \cap D| \geq 2$. The minimum cardinality of such a set is known as the $\mathcal{SMP}$- domination number and is denoted $\gamma_{\mathcal{SMP}}$. In this paper, we find the $\mathcal{SMP}$- domination number of power graphs for some special graphs like umbrella graph, coconut tree graph and tadpole graph.

Zitieren

APA

Mahadevan, G., Praveenkumar, L., Sivagnanam, C., & Vijayalakshmi, S. (2026). Characterizing the $\mathcal{SMP}$ Domination Number of k-Power Graphs. Boletim da Sociedade Paranaense de Matemática, 44(14), 1-10. https://doi.org/10.5269/bspm.85878

Vancouver

Mahadevan G, Praveenkumar L, Sivagnanam C, Vijayalakshmi S. Characterizing the $\mathcal{SMP}$ Domination Number of k-Power Graphs. Boletim da Sociedade Paranaense de Matemática. 2026;44(14):1-10. doi:10.5269/bspm.85878

BibTeX
@article{Mahadevan2026,
  author = {Mahadevan, G. and Praveenkumar, L. and Sivagnanam, C. and Vijayalakshmi, S.},
  title = {Characterizing the $\mathcalSMP$ Domination Number of k-Power Graphs},
  journal = {Boletim da Sociedade Paranaense de Matemática},
  year = {2026},
  volume = {44},
  number = {14},
  pages = {1--10},
  doi = {10.5269/bspm.85878}
}
Kostenlos starten →