Scopus
YÖKSİS Eşleşti
On the lower bound for Laplacian resolvent energy through majorization
Discrete Mathematics, Algorithms and Applications · Şubat 2025
YÖKSİS Kayıtları
On the lower bound for Laplacian resolvent energy through majorization
Discrete Mathematics, Algorithms and Applications · 2025 ESCI
PROFESÖR ŞERİFE BURCU BOZKURT ALTINDAĞ →
Makale Bilgileri
DergiDiscrete Mathematics, Algorithms and Applications
Yayın TarihiŞubat 2025
Cilt / Sayfa17
Scopus ID2-s2.0-85189539449
Özet
For a simple connected graph G of order n with Laplacian eigenvalues μ1 ≥ μ2 ≥ · · · ≥ μn−1 > μn = 0, the Laplacian resolvent energy of G is defined as RL(G) = \sumni=1 n+11−μi . In this paper, we provide an improved lower bound for RL(G) through majorization. Considering our lower bound, we also derive some lower bounds for RL(G) when the graph G possesses tree structure.
Yazarlar (3)
1
B.Bozkurt Altındag
ORCID: 0009-0003-3185-886X
2
I. Milovanović
ORCID: 0000-0003-2209-9606
3
E. Milovanović
ORCID: 0000-0002-1905-4813
Anahtar Kelimeler
Graph
Laplacian eigenvalues
Laplacian resolvent energy
Kurumlar
Selçuk Üniversitesi
Selçuklu Turkey
University of Niš
Nis Serbia