SOME NEIGHBOURHOOD DEGREE BASED REACHABILITY ENERGY AND INDEX FOR REGULAR GRAPH

Authors

  • R. Thirumalaisamy
  • S. Bala
  • T. Vijay
  • K. Thirusangu

Keywords:

Regular graph, Reachability matrix, Spectrum of a graph, Energy, Estrada Index

Abstract

A regular graph is a graph in which all vertices have the same degree. If every vertex in a graph has degree k, then the graph is called a k-regular graph. In this paper, we introduce some open neighbourhood degree-based reachability matrices of graph and obtain its Energy and Estrada index. Also, we establish the bounds for this energy and index.

Downloads

Published

2025-08-16

How to Cite

R. Thirumalaisamy, S. Bala, T. Vijay, & K. Thirusangu. (2025). SOME NEIGHBOURHOOD DEGREE BASED REACHABILITY ENERGY AND INDEX FOR REGULAR GRAPH. Utilitas Mathematica, 122(Special Issue-1), 1362–1382. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/2661

Issue

Vol. 122 No. Special Issue-1 (2025): Special Issue on Multidisciplinary Studies in Education, Engineering, Science, Management, Technology and Humanities

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.