Graph Operations based on Using Distance-based Graph Entropies

Modjtaba Ghorbani; Matthias Dehmer; Samaneh Zangi

doi:10.1016/j.amc.2018.04.003

Graph Operations based on Using Distance-based Graph Entropies

Modjtaba Ghorbani, Matthias Dehmer, Samaneh Zangi

Publikation: Beitrag in Fachzeitschrift › Artikel › Begutachtung

17 Zitate (Scopus)

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.

Originalsprache	Englisch
Seiten (von - bis)	547-555
Seitenumfang	9
Fachzeitschrift	Applied Mathematics and Computation
Jahrgang	333
DOIs	https://doi.org/10.1016/j.amc.2018.04.003
Publikationsstatus	Veröffentlicht - 15 Sep. 2018

Zugriff auf Dokument

10.1016/j.amc.2018.04.003

Andere Dateien und Links

Link zur Publikation in Scopus

Zitieren

@article{7c24179e45a840dfac6b87aefe6d2b23,

title = "Graph Operations based on Using Distance-based Graph Entropies",

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 = "Automorphism group, Fullerene, Graph entropy",

author = "Modjtaba Ghorbani and Matthias Dehmer and Samaneh Zangi",

year = "2018",

month = sep,

day = "15",

doi = "10.1016/j.amc.2018.04.003",

language = "English",

volume = "333",

pages = "547--555",

journal = "Applied Mathematics and Computation",

issn = "1873-5649",

publisher = "Elsevier",

}

TY - JOUR

T1 - Graph Operations based on Using Distance-based Graph Entropies

AU - Ghorbani, Modjtaba

AU - Dehmer, Matthias

AU - Zangi, Samaneh

PY - 2018/9/15

Y1 - 2018/9/15

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

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

KW - Automorphism group

KW - Fullerene

KW - Graph entropy

UR - http://www.scopus.com/inward/record.url?scp=85046373235&partnerID=8YFLogxK

U2 - 10.1016/j.amc.2018.04.003

DO - 10.1016/j.amc.2018.04.003

M3 - Article

SN - 1873-5649

VL - 333

SP - 547

EP - 555

JO - Applied Mathematics and Computation

JF - Applied Mathematics and Computation

ER -

Graph Operations based on Using Distance-based Graph Entropies

Abstract

Zugriff auf Dokument

Andere Dateien und Links

Fingerprint

Zitieren