✨
Yapay Zeka Hızlı Bakış & Çıkarımlar
AI Insight⚡ TL;DR(1 Cümlede Hızlı Çıkarım)
Wealso characterize graphs for which the bound is attained.
📌 3 Maddede Bu Makale
🎯
Amaç & Hipotez:We consider weighted graphs, where the edge weights are positive definite matrices.
📊
Temel Bulgular & Veri:The eigenvalues of a graph are the eigenvalues of itsadjacency matrix.
💡
Sonuç & Katkı:Wealso characterize graphs for which the bound is attained.
🔬Tür:Araştırma Makalesi
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:Weighted graph · Adjacency matrix · Spectral radius
Abstract
We consider weighted graphs, where the edge weights are positive definite matrices. The eigenvalues of a graph are the eigenvalues of itsadjacency matrix. We obtain another upper bound which is sharp onthe spectral radius of the adjacency matrix and compare with someknown upper bounds with the help of some examples of graphs. Wealso characterize graphs for which the bound is attained.
Anahtar kelimeler
🔖
Bu Makaleye Atıf Yap
OZARSLAN, S., SORGUN, S., BUYUKKOSE, S. (2022). AN UPPER BOUND ON THE SPECTRAL RADIUS OF WEIGHTED GRAPHS. Hacettepe Journal of Mathematics and Statistics, Cilt: 42 - Sayı: 5, 517–524. https://ajindex.com/articles/530441