Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8900935 | Applied Mathematics and Computation | 2018 | 9 Pages |
Abstract
Let G be a connected graph. The eccentricity of vertex v is the maximum distance between v and other vertices of G. In this paper, we study a new version of graph entropy based on eccentricity of vertices of G. In continuing, we study this graph entropy for some classes of graph operations. Finally, we compute the graph entropy of two classes of fullerene graphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Modjtaba Ghorbani, Matthias Dehmer, Samaneh Zangi,