JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE) ›› 2022, Vol. 57 ›› Issue (6): 44-53.doi: 10.6040/j.issn.1671-9352.0.2021.718

Previous Articles    

Degree-based graph entropy on graph operations

WU Chuan-shu1,3, ZHAO Hai-xing2,3, DENG Bo1,3*   

  1. 1. College of Mathematics and Statistics, Qinghai Normal University, Xining 810008, Qinghai, China;
    2. College of Computer, Qinghai Normal University, Xining 810008, Qinghai, China;
    3. The State Key Laboratory of Tibetan Intelligent Information Processing and Application, Xining 810008, Qinghai, China
  • Published:2022-06-10

PDF (PC)

293

Abstract: Graph invariants are widely used to construct entropy-based metrics to describe the structures of complex networks. In particular, graph entropy based on vertex degrees is often used to measure graph structure information after graph operations.The degree-based graph entropy calculation on some graph operations containing the symmetric difference, Cartesian product, tensor product, Corona product of graphs are presented. These results are applied to calculate the degree-based graph entropy of molecular graphs such as nano-structure and hypercubes.

Key words: graph operation, graph entropy, Shannon entropy, vertex degree, molecular graph

CLC Number: 

  • O157.5
[1] SHANNON C E, WEAVER W. The mathematical theory of communication[M]. Urbana: University of Illinois Press, 1949.
[2] RASHEVSKY N. Life, information theory, and topology[J]. The Bulletin of Mathematical Biophysics, 1955, 17(3):229-235.
[3] TRUCCO E. A note on the information content of graphs[J]. The Bulletin of Mathematical Biophysics, 1956, 18(2):129-135.
[4] MOWSHOWITZ A. Entropy and the complexity of graphs: I. an index of the relative complexity of a graph[J]. The Bulletin of Mathematical Biophysics, 1968, 30(1):175-204.
[5] MOWSHOWITZ A. Entropy and the complexity of graphs: II. the information content of digraphs and infinite graphs[J]. The Bulletin of Mathematical Biophysics, 1968, 30(2):225-240.
[6] MOWSHOWITZ A. Entropy and the complexity of graphs: III. graphs with prescribed information content[J]. The Bulletin of Mathematical Biophysics, 1968, 30(3):387-414.
[7] MOWSHOWITZ A. Entropy and the complexity of graphs: IV. entropy measures and graphical structure[J]. The Bulletin of Mathematical Biophysics, 1968, 30(4):533-546.
[8] KÖRNER J. Coding of an information source having ambiguous alphabet and the entropy of graphs[C] // 6th Prague Conference on Information Theory. [S.l.] : Walter. de. Gruyter, 1973: 411-425.
[9] LU G X, LI B Q, WANG L J. Some new properties for degree-based graph entropies[J]. Entropy, 2015, 17(12):8217-8227.
[10] CAO S J, DEHMER M, SHI Y T. Extremality of degree-based graph entropies[J]. Information Sciences, 2014, 278:22-33.
[11] DONG Y N, QIAO S N, CHEN B, et al. Maximum values of degree-based entropies of bipartite graphs[J]. Applied Mathematics and Computation, 2021, 401:126094.
[12] DEHMER M. Information processing in complex networks: graph entropy and information functionals[J]. Applied Mathematics and Computation, 2008, 201(1/2):82-94.
[13] DEHMER M, MOWSHOWITZ A. A history of graph entropy measures[J]. Information Sciences, 2011, 181(1):57-78.
[14] YEGNANARAYANAN V, THIRIPURASUNDARI P R, PADMAVATHY T. On some graph operations and related applications[J]. Electronic Notes in Discrete Mathematics, 2009, 33:123-130.
[15] FATH-TABAR G H, VAEZ-ZADEH B, ASHRAFI A R, et al. Some inequalities for the atom-bond connectivity index of graph operations[J]. Discrete Applied Mathematics, 2011, 159(13):1323-1330.
[16] KHALIFEH M H, YOUSEFI-AZARI H, ASHRAFI A R. Vertex and edge PI indices of Cartesian product graphs[J]. Discrete Applied Mathematics, 2008, 156(10):1780-1789.
[17] KHALIFEH M H, YOUSEFI-AZARI H, ASHRAFI A R. The Hyper-Wiener index of graph operations[J]. Computers & Mathematics with Applications, 2008, 56(5):1402-1407.
[18] KHALIFEH M H, YOUSEFI-AZARI H, ASHRAFI A R. The first and second Zagreb indices of some graph operations[J]. Discrete Applied Mathematics, 2009, 157(4):804-811.
[19] YERO I G, RODRÍGUEZ-VELÁZQUEZ J A. On the Randic index of corona product graph[J]. International Scholarly Research Notices, 2011, 2011:262183.
[20] GHORBANI M, DEHMER M, ZANGI S. Graph operations based on using distance-based graph entropies[J]. Applied Mathematics and Computation, 2018, 333:547-555.
[21] BONDY J A, MURTY U S R. Graph theory[M]. New York: Springer, 2008.
[22] DEHMER M, VARMUZA K, BORGERT S, et al. On entropy-based molecular descriptors: statistical analysis of real and synthetic chemical structures[J]. Journal of Chemical Information and Modeling, 2009, 49(7):1655-1663.
[23] DEHMER M, SELVAGANESH L, VARMUZA K. Uniquely discriminating molecular structures using novel eigenvalue-based descriptors[J]. MATCH Communications in Mathematical and in Computer Chemistry, 2012, 67(1):147-172.
[24] IMRICH W, KLAV S. Zar: product graphs: structure and recognition[M]. New York: John Wiley & Sons, 2000.
[25] NAJI A M, SONER N D. The first leap Zagreb index of some graph operations[J]. International Journal of Applied Graph Theory, 2018, 2(1):7-18.
[26] ASHRAFI A R, DOŠLIC T, HAMZEH A. The Zagreb coindices of graph operations[J]. Discrete Applied Mathematics, 2010, 158(15):1571-1578.
[27] RANI A, IMRAN M, ALI U. Sharp bounds for the inverse sum indeg index of graph operations[J]. Mathematical Problems in Engineering, 2021, 2021:5561033.
[1] LU Peng-li, LIU Wen-zhi. On the generalized distance spectrum of graphs [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2020, 55(9): 19-28.
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
Copyright 2018 © Editorial office of JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE)
Supported by Beijing Magtech Co.Ltd