On the Terminal Distance Matrix of Graphs

Author(s):

Abbas Heydari*

Message:
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:

Let G be a simple connected graph. The terminal distance matrix of G is the distance matrix between all pendant vertices of G. In this paper, we study the terminal distance matrix and compute the characteristic polynomial of this matrix for some rooted trees. Also we obtain lower bounds for the spectral radius of the terminal distance matrix of graphs and characterize those graphs for which the bounds are best possible.

Keywords:

Terminal Distance Matrix , Terminal Distance Spectral Radius , Terminal Wiener Index

Language:
English
Published:
Iranian Journal of Mathematical Sciences and Informatics, Volume:20 Issue: 1, May 2025
Pages:
231 to 241
https://www.magiran.com/p2851988  
سامانه نویسندگان
  • Author
    Abbas Heydari
    Associate Professor Mathmatics,
    Heydari، Abbas
اطلاعات نویسنده(گان) توسط ایشان ثبت و تکمیل شده‌است. برای مشاهده مشخصات و فهرست همه مطالب، صفحه رزومه را ببینید.
مقالات دیگری از این نویسنده (گان)