Degree Based Root Connectivity Energy of Graph

Auteurs-es

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

DOI :

https://doi.org/10.5269/bspm.77981

Résumé

The purpose of this paper is to introduce and investigate Degree based root connectivity matrix
and the corresponding energy of graph structures. The upper and lower bounds have been established. Further
we generalize the Degree based root connectivity energy to various families of graphs including some regular
and semi regular graphs.

Téléchargements

Publié

2025-11-01

Numéro

Rubrique

Research Articles