EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Perfect Pendant Domination in Graphs

Prakasha M. N., Purushothama S., Puttaswamy, Nayaka S. R.

Boletim da Sociedade Paranaense de Matemática · 22.03.2026 · 44 · 1-7

DOI: 10.5269/bspm.79181 ↗

Kurz gefasst

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

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Let G=(V(G),E(G)) be a simple connected graph. A set S\subseteq V(G) is said to be a perfect pendant dominating set of G if S is a perfect dominating set and pendant dominating set of G. The minimum cardinality of a perfect pendant dominating set of G is called perfect pendant domination number, and is denoted by \gamma_{ppe}(G). A perfect pendant dominating set S with |S|=\gamma_{ppe}(G) is said to be \gamma_{ppe}-set. In this paper we give a characterization of perfect pendant dominating set of some graphs and graphs obtained from the join and corona product of two graphs. Moreover, the perfect pendant domination number of the forenamed graphs is determined and also, graphs having no perfect pendant dominating set are examined.

Zitieren

APA

N., P. M., S., P., Puttaswamy, & R., N. S. (2026). Perfect Pendant Domination in Graphs. Boletim da Sociedade Paranaense de Matemática, 44, 1-7. https://doi.org/10.5269/bspm.79181

Vancouver

N. PM, S. P, Puttaswamy, R. NS. Perfect Pendant Domination in Graphs. Boletim da Sociedade Paranaense de Matemática. 2026;44:1-7. doi:10.5269/bspm.79181

BibTeX
@article{N2026,
  author = {N., Prakasha M. and S., Purushothama and Puttaswamy and R., Nayaka S.},
  title = {Perfect Pendant Domination in Graphs},
  journal = {Boletim da Sociedade Paranaense de Matemática},
  year = {2026},
  volume = {44},
  pages = {1--7},
  doi = {10.5269/bspm.79181}
}
Kostenlos starten →