✨
Yapay Zeka Hızlı Bakış & Çıkarımlar
AI Insight⚡ TL;DR(1 Cümlede Hızlı Çıkarım)
In this report, we first determine M-polynomial of the Line graph of those three graphs using subdivision idea and then compute some degree based indices of the same.
📌 3 Maddede Bu Makale
🎯
Amaç & Hipotez:Three composite graphs Ladder graph (L_{n}), Tadpole graph (T_{n,k}) and Wheel graph (W_{n}) are graceful graphs, which have different applications in electrical, electronics, wireless communication etc.
📊
Temel Bulgular & Veri:Three composite graphs Ladder graph (L_{n}), Tadpole graph (T_{n,k}) and Wheel graph (W_{n}) are graceful graphs, which have different applications in electrical, electronics, wireless communication etc.
💡
Sonuç & Katkı:In this report, we first determine M-polynomial of the Line graph of those three graphs using subdivision idea and then compute some degree based indices of the same.
🔬Tür:Research Article
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:M-polynomial · degree based topological index · line graph
Abstract
Three composite graphs Ladder graph (L_{n}), Tadpole graph (T_{n,k}) and Wheel graph (W_{n}) are graceful graphs, which have different applications in electrical, electronics, wireless communication etc. In this report, we first determine M-polynomial of the Line graph of those three graphs using subdivision idea and then compute some degree based indices of the same.
🔖
Bu Makaleye Atıf Yap
Mondal, S., De, N., Pal, A. (2019). The M-polynomial of line graph of subdivision graphs. Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics, Volume: 68 Issue: 2. https://doi.org/10.31801/cfsuasmas.587655