Graph operations based on using distance-based graph entropies

Modjtaba Ghorbani, Matthias Dehmer and Samaneh Zangi

Applied Mathematics and Computation, 2018, vol. 333, issue C, 547-555

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.

Keywords: Graph entropy; Automorphism group; Fullerene (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318303072
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:333:y:2018:i:c:p:547-555

DOI: 10.1016/j.amc.2018.04.003

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().