EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Degree Power Product Connectivity Energy of Graph

M. J. Sridevi, M.K. Natesh, H. C. Shashikumar

Boletim da Sociedade Paranaense de Matemática · 01.11.2025 · 43 · 1-8

DOI: 10.5269/bspm.78604 ↗

Kurz gefasst

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

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In this paper we introduce and investigate degree power product connectivity matrix (which is basically a degree based matrix) and the corresponding energy of graph structures. The upper and lower bounds have been obtained. Further we generalize the degree power product connectivity energy to various families of graphs including some regular and semi regular graphs.

Zitieren

APA

Sridevi, M. J., Natesh, M., & Shashikumar, H. C. (2025). Degree Power Product Connectivity Energy of Graph. Boletim da Sociedade Paranaense de Matemática, 43, 1-8. https://doi.org/10.5269/bspm.78604

Vancouver

Sridevi MJ, Natesh M, Shashikumar HC. Degree Power Product Connectivity Energy of Graph. Boletim da Sociedade Paranaense de Matemática. 2025;43:1-8. doi:10.5269/bspm.78604

BibTeX
@article{Sridevi2025,
  author = {Sridevi, M. J. and Natesh, M.K. and Shashikumar, H. C.},
  title = {Degree Power Product Connectivity Energy of Graph},
  journal = {Boletim da Sociedade Paranaense de Matemática},
  year = {2025},
  volume = {43},
  pages = {1--8},
  doi = {10.5269/bspm.78604}
}
Kostenlos starten →