Graph operations based on using distance-based graph entropies

被引:13
|
作者
Ghorbani, Modjtaba [1 ]
Dehmer, Matthias [2 ,3 ]
Zangi, Samaneh [1 ]
机构
[1] Shahid Rajaee Teacher Training Univ, Dept Math, Fac Sci, Tehran 16785136, Iran
[2] Univ Appl Sci Upper Austria, Inst Intelligent Prod, Fac Management, Steyr Campus, Wels, Austria
[3] UMIT, Dept Biomed Comp Sci & Mechatron, Hall In Tirol, Austria
基金
奥地利科学基金会;
关键词
Graph entropy; Automorphism group; Fullerene; TOPOLOGICAL INDEXES;
D O I
10.1016/j.amc.2018.04.003
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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. (C) 2018 Elsevier Inc. All rights reserved.
引用
收藏
页码:547 / 555
页数:9
相关论文
共 50 条
  • [21] On distance-based topological indices and co-indices of fractal-type molecular graphs and their respective graph entropies
    Malik, Mehar Ali
    Imran, Muhammad
    Adeel, Muhammad
    PLOS ONE, 2023, 18 (11):
  • [22] On Properties of Distance-Based Entropies on Fullerene Graphs
    Ghorbani, Modjtaba
    Dehmer, Matthias
    Rajabi-Parsa, Mina
    Mowshowitz, Abbe
    Emmert-Streib, Frank
    ENTROPY, 2019, 21 (05):
  • [23] EXTREMAL PROPERTIES OF DISTANCE-BASED GRAPH INVARIANTS FOR k-TREES
    Zhang, Minjie
    Li, Shuchao
    MATHEMATICA BOHEMICA, 2018, 143 (01): : 41 - 66
  • [24] SOME DISTANCE-BASED TOPOLOGICAL INDICES OF A NON-COMMUTING GRAPH
    Mirzargar, M.
    Ashrafi, A. R.
    HACETTEPE JOURNAL OF MATHEMATICS AND STATISTICS, 2012, 41 (04): : 515 - 526
  • [25] SPECTRA OF GRAPH OPERATIONS BASED ON SPLITTING GRAPH*
    Lu, Zhiqin
    Ma, Xiaoling
    Zhang, Minshao
    JOURNAL OF APPLIED ANALYSIS AND COMPUTATION, 2023, 13 (01): : 133 - 155
  • [26] Generalized Degree-Based Graph Entropies
    Lu, Guoxiang
    SYMMETRY-BASEL, 2017, 9 (03):
  • [27] NORDHAUS-GADDUM-TYPE RESULTS FOR RESISTANCE DISTANCE-BASED GRAPH INVARIANTS
    Das, Kinkar Ch
    Yang, Yujun
    Xu, Kexiang
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2016, 36 (03) : 695 - 707
  • [28] Extremality of degree-based graph entropies
    Cao, Shujuan
    Dehmer, Matthias
    Shi, Yongtang
    INFORMATION SCIENCES, 2014, 278 : 22 - 33
  • [29] Distributed computing of distance-based graph invariants for analysis and visualization of complex networks
    Czech, Wojciech
    Mielczarek, Wojciech
    Dzwinel, Witold
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2017, 29 (09):
  • [30] Multi-label Feature Extraction With Distance-Based Graph Attention Network
    Peng, Yue
    Qian, Kun
    Song, Guojie
    Min, Fan
    ROUGH SETS, IJCRS 2022, 2022, 13633 : 203 - 216