A Preliminary Study of Randic Spread of Graphs

Authors

  • Aditya Pegu Department of Mathematics, Dibrugarh University, Assam-786004, India.
  • I. J. Gogoi Department of Mathematics, Dibrugarh University, Assam-786004, India.
  • Rubul Moran Department of Mathematics, Dibrugarh University, Assam-786004, India.
  • A. Bharali Department of Mathematics, Dibrugarh University, Assam-786004, India.

DOI:

https://doi.org/10.9734/bpi/tpmcs/v11/1499A

Keywords:

Randi? spread, Randi? matrix, spread

Abstract

For a simple undirected graph  spread is defined as the difference between the largest and the smallest eigenvalue of the graph. As 1 is the largest eigenvalue of the Randic matrix therefore disregarding the spectral radius, the Randic spread  is the difference between the second largest and the smallest eigenvalue of the Randic matrix. In this communication we have studied the bounds for Randic spread. Moreover we have introduced a new upper and lower bound for this spread.

Published

2021-05-24

How to Cite

Aditya Pegu, I. J. Gogoi, Rubul Moran, & A. Bharali. (2021). A Preliminary Study of Randic Spread of Graphs. Theory and Practice of Mathematics and Computer Science Vol. 11, 143–153. https://doi.org/10.9734/bpi/tpmcs/v11/1499A

Issue

Theory and Practice of Mathematics and Computer Science Vol. 11

Section

Chapters