✨
Yapay Zeka Hızlı Bakış & Çıkarımlar
AI Insight⚡ TL;DR(1 Cümlede Hızlı Çıkarım)
Upper and lower bounds on $ES_{Lc}\left( \mathcal{G}\right) $ are presented.
📌 3 Maddede Bu Makale
🎯
Amaç & Hipotez:This work proposes a matrix called minimum covering Seidel Laplacian matrix and a new type of graph energy called minimum covering Seidel Laplacian energy $ES_{Lc}\left( \mathcal{G}\right)$ which depends on its appropriate minimum covering set.
📊
Temel Bulgular & Veri:This work proposes a matrix called minimum covering Seidel Laplacian matrix and a new type of graph energy called minimum covering Seidel Laplacian energy $ES_{Lc}\left( \mathcal{G}\right)$ which depends on its appropriate minimum covering set.
💡
Sonuç & Katkı:Upper and lower bounds on $ES_{Lc}\left( \mathcal{G}\right) $ are presented.
🔬Tür:Research Article
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:Minimum covering Seidel Laplacian energy · eigenvalue · graph
Abstract
This work proposes a matrix called minimum covering Seidel Laplacian matrix and a new type of graph energy called minimum covering Seidel Laplacian energy $ES_{Lc}\left( \mathcal{G}\right)$ which depends on its appropriate minimum covering set. Upper and lower bounds on $ES_{Lc}\left( \mathcal{G}\right) $ are presented.
Anahtar kelimeler
🔖
Bu Makaleye Atıf Yap
Yalçın, N. F., Kırmızı, N. (2025). Minimum Covering Seidel Laplacian Energy of a Graph. Turkish Journal of Mathematics and Computer Science, Volume: 17 Issue: 1. https://doi.org/10.47000/tjmcs.1528087