KaydedilenlerDerginizi ekleyin

Dergiler / Bilgisayar Bilimleri / 2021 / Cilt: 6 - Sayı: 2

Grafların ve-derece, ev-derece ve Birinci Zagreb İndeks Entropileri

ve-degree, ev-degree and First Zagreb Index Entropies of Graphs

Bünyamin ŞAHİN
Abdulgani ŞAHİN
Sayfa
90–101
Yayın Tarihi
2021-06-01
DOI
—
🏛️Bu makalenin bibliyografik verileri ve tam metin bağlantısı DergiPark üzerinden sağlanmıştır.
DergiPark Kaydı ↗
✨

Yapay Zeka Hızlı Bakış & Çıkarımlar

AI Insight
⚡ TL;DR(1 Cümlede Hızlı Çıkarım)

Finally we obtain the maximal trees with respect to ve-degree irregularity index.

📌 3 Maddede Bu Makale

🎯
Amaç & Hipotez:Chellali et al. introduced two degree concepts, ve-degree and ev-degree (Chellali et al, 2017).
📊
Temel Bulgular & Veri:The ve-degree of a vertex v equals to number of different edges which are incident to a vertex from the closed neighborhod of v.
💡
Sonuç & Katkı:Finally we obtain the maximal trees with respect to ve-degree irregularity index.
🔬Tür:Araştırma Makalesi
📍Kapsam:2017 Verileri
⚙️Değişkenler:ve-derece · ev-derece · entropi

Özet

Chellali et al. introduced two degree concepts, ve-degree and ev-degree (Chellali et al, 2017). The ve-degree of a vertex v equals to number of different edges which are incident to a vertex from the closed neighborhod of v. Moreover the ev-degree of an edge e=ab equals to the number of vertices of the union of the closed neighborhoods of a and b. The most private feature of these degree concepts is, total number of ve-degrees and total number of ev-degrees equal to first Zagreb index of the graphs for triangle-free graphs. In this paper we introduce ve-degree entropy, ev-degree entropy and investigate the relations between these entropies and the first Zagreb index entropy. Finally we obtain the maximal trees with respect to ve-degree irregularity index.

Abstract

Chellali et al. introduced two degree concepts, ve-degree and ev-degree (Chellali et al, 2017). The ve-degree of a vertex v equals to number of different edges which are incident to a vertex from the closed neighborhod of v. Moreover the ev-degree of an edge e=ab equals to the number of vertices of the union of the closed neighborhoods of a and b. The most private feature of these degree concepts is, total number of ve-degrees and total number of ev-degrees equal to first Zagreb index of the graphs for triangle-free graphs. In this paper we introduce ve-degree entropy, ev-degree entropy and investigate the relations between these entropies and the first Zagreb index entropy. Finally we obtain the maximal trees with respect to ve-degree irregularity index.

🔖

Bu Makaleye Atıf Yap

ŞAHİN, B., ŞAHİN, A. (2021). Grafların ve-derece, ev-derece ve Birinci Zagreb İndeks Entropileri. Bilgisayar Bilimleri, Cilt: 6 - Sayı: 2, 90–101. https://ajindex.com/articles/743197

📄 Tam Metin PDF Okuyucu

📄

PDF görüntüleyici hazırlanıyor...

Kaynakça (19)

  1. V. Kraus, M. Dehmer, F. Emmert-Streib, Probabilistic inequalities for evaluating structural network measures, Inform. Sci. 288 (2014), 220–245
  2. M. Dehmer, F. Emmert-Streib, M. Grabner, A computational approach to construct a multivariate complete graph invariant, Inform. Sci. 260 (2014), 200–208
  3. A. Mowshowitz, M. Dehmer, Entropy and the complexity of graphs revisited, Entropy 14 (3) (2012), 559–570
  4. M. Dehmer, A. Mowshowitz, A case study of cracks in the scientific enterprise: reinvention of information-theoretic measures for graphs, Complexity (2014)
  5. Y. Chen, K. Wu, X. Chen, C. Tang, Q. Zhu, An entropy-based uncertainty measurement approach in neighborhood systems, Inform. Sci. 279 (2014), 239–250
  6. C. Wang, A. Qu, Entropy, similarity measure and distance measure of vague soft sets and their relations, Inform. Sci. 244 (2013) 92–106
  7. M. Dehmer, A. Mowshowitz, A history ofgraph entropy measures, Inform. Sci. 181 (2011), 57–78
  8. M. Dehmer, Information processing in complex networks: graph entropy and information functionals, Appl. Math. Comput. 201 (2008), 82–94
  9. M. Dehmer, A. Mowshowitz, Y. Shi, Structural differentiation of graphs using Hosoya- based indices, PLoS ONE 9 (7) (2014) e102459
  10. S. Dragomir, C. Goh, Some bounds on entropy measures in information theory, Appl. Math. Lett. 10 (1997) 23–28
  11. Z. Chen, M. Dehmer, Y. Shi, A note on distance-based graph entropies, Entropy 16 (10) (2014), 5416–5427
  12. J. Cao, M. Shi, L. Feng, On the edge-hyper-hamiltonian laceability of balanced hypercubes, Discuss Math. Graph Theory. 36 (2016), 805–817
  13. L. Feng, J. Cao, W. Liu, S. Ding, H. Liu, The spectral radius of edge chromatic critical graphs, Linear Algebra Appl. 492 (2016) 78–88
  14. G. Yu, X. Liu, H. Qu, Singularity of Hermitian (quasi-)Laplacian matrix of mixed graphs, Appl. Math. Comput. 293 (2017) 287–292
  15. S. Cao, M. Dehmer, Y. Shi, Extremality of degree based graph entropies, Information Sciences 278 (2014), 22-33
  16. S. Cao, M. Dehmer, Degree based entropies of networks revisited, Appl. Math. Comput. 261 (2015) 141-147
  17. K. C. Das, M. Dehmer, A conjecture regarding the extremal values of graph entropy based on degree powers, Entropy18 (2016) #183
  18. K. C. Das, Y. Shi, Some properties on entropies of graphs, MATCH Commun. Math. Comput. Chem. 78 (2017), 259-272
  19. S. Cao, M. Dehmer, Z. Kang, Network entropies based on independent sets and matchings, Appl. Math. Comput. 307 (2017) 265–270