Article
Version 1
This version is not peer-reviewed
ve-degree, ev-degree and First Zagreb Index Entropies of Graphs
Version 1
: Received: 3 April 2021 / Approved: 5 April 2021 / Online: 5 April 2021 (12:20:10 CEST)
How to cite: Şahin, B.; Şahin, A. ve-degree, ev-degree and First Zagreb Index Entropies of Graphs. Preprints 2021, 2021040117 Şahin, B.; Şahin, A. ve-degree, ev-degree and First Zagreb Index Entropies of Graphs. Preprints 2021, 2021040117
Abstract
Chellali et al. introduced two degree concepts, ve-degree and ev-degree (Chellali et al, 2017). The ve-degree of a vertex 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.
Keywords
ve-degree, ev-degree, entropy, information functional
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
