EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

The Minimum Pendant Dominating Randic Graph Energy

Nataraj K, Puttaswamy, Purushothama S.

Boletim da Sociedade Paranaense de Matemática · 30.10.2025 · 43 · 1-12

DOI: 10.5269/bspm.78077 ↗

Kurz gefasst

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

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In this research paper, we introduce the concept of minimum pendant dominating randic graph energy, denoted by $RE_{P}^{D}(\Gamma)$, and compute its value for several well-known graph families, including the complete graph, complete bipartite graph, bi-star graph, cocktail party, and barbell graph. Additionally, we investigate theoretical upper and lower bounds for $RE_{P}^{D}(\Gamma)$, offering insights into the behavior and range of this energy measure across various classes of graphs.

Zitieren

APA

K, N., Puttaswamy, & S., P. (2025). The Minimum Pendant Dominating Randic Graph Energy. Boletim da Sociedade Paranaense de Matemática, 43, 1-12. https://doi.org/10.5269/bspm.78077

Vancouver

K N, Puttaswamy, S. P. The Minimum Pendant Dominating Randic Graph Energy. Boletim da Sociedade Paranaense de Matemática. 2025;43:1-12. doi:10.5269/bspm.78077

BibTeX
@article{K2025,
  author = {K, Nataraj and Puttaswamy and S., Purushothama},
  title = {The Minimum Pendant Dominating Randic Graph Energy},
  journal = {Boletim da Sociedade Paranaense de Matemática},
  year = {2025},
  volume = {43},
  pages = {1--12},
  doi = {10.5269/bspm.78077}
}
Kostenlos starten →