Bilgisayar Bilimleri

Yazarlar: Bünyamin ŞAHİN, Abdulgani ŞAHİN

Konular:Bilgisayar Bilimleri, Disiplinler Arası Uygulamalar

Anahtar Kelimeler:Ve-derece,Ev-derece,Entropi,Bilgi fonksiyoneli

Ö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.

---