دوره 20، شماره 1 - ( 1-1404 )
جلد 20 شماره 1 صفحات 241-231 |
برگشت به فهرست نسخه ها
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Heydari A. On the Terminal Distance Matrix of Graphs. IJMSI 2025; 20 (1) :231-241
URL: http://ijmsi.ir/article-1-1936-fa.html
URL: http://ijmsi.ir/article-1-1936-fa.html
On the Terminal Distance Matrix of Graphs. مجله علوم ریاضی و انفورماتیک. 1404; 20 (1) :231-241
چکیده:
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.
| بازنشر اطلاعات | |
 |
این مقاله تحت شرایط Creative Commons Attribution-NonCommercial 4.0 International License قابل بازنشر است. |
