Refined Lower Bounds for the Laplacian Estrada Index of Connected Graphs via the Two Largest Degrees.

Saved in:
Bibliographic Details
Title: Refined Lower Bounds for the Laplacian Estrada Index of Connected Graphs via the Two Largest Degrees.
Authors: Bamdad, Hamidreza1 (AUTHOR) hr_bamdad@pnu.ac.ir, Vahidi, Alireza1 (AUTHOR), Mahmoodi, Akram1 (AUTHOR), Sen, Smritijit1 (AUTHOR) smsen@wiley.com
Source: Journal of Mathematics. 8/31/2026, Vol. 2026, p1-5. 5p.
Database: Mathematics Source
Full text is not displayed to guests.
Be the first to leave a comment!
You must be logged in first