×

Entropy of weighted graphs with Randić weights. (English) Zbl 1338.05266


MSC:

05C90 Applications of graph theory
92E10 Molecular structure (graph-theoretic methods, methods of differential topology, etc.)
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Shannon, The Mathematical Theory of Communication (1949) · Zbl 0041.25804
[2] Rashevsky, Life, information theory, and topology, Bull. Math. Biophys. 17 pp 229– (1955) · doi:10.1007/BF02477860
[3] Mowshowitz, Entropy and the complexity of the graphs I: An index of the relative complexity of a graph, Bull. Math. Biophys. 30 pp 175– (1968) · Zbl 0165.57601 · doi:10.1007/BF02476948
[4] Mowshowitz, Entropy and the complexity of graphs II: The information content of digraphs and infinite graphs, Bull. Math. Biophys. 30 pp 225– (1968) · Zbl 0165.57602 · doi:10.1007/BF02476692
[5] Mowshowitz, Entropy and the complexity of graphs III: Graphs with prescribed information content, Bull. Math. Biophys. 30 pp 387– (1968) · Zbl 0165.57603 · doi:10.1007/BF02476603
[6] Mowshowitz, Entropy and the complexity of graphs IV: Entropy measures and graphical structure, Bull. Math. Biophys. 30 pp 533– (1968) · Zbl 0204.24603 · doi:10.1007/BF02476673
[7] Dehmer, The discrimination power of molecular identification numbers revisited, MATCH Commun. Math. Comput. Chem. 69 pp 785– (2013)
[8] Kraus, On sphere-regular graphs and the extremality of information-theoretic network measures, MATCH Commun. Math. Comput. Chem. 70 pp 885– (2013)
[10] Kraus, Probabilistic inequalities for evaluating structural network measures, Inf. Sci. 288 pp 220– (2014) · Zbl 1355.05240 · doi:10.1016/j.ins.2014.07.018
[11] Dehmer, A computational approach to construct a multivariate complete graph invariant, Inf. Sci. 260 pp 200– (2014) · Zbl 1329.05279 · doi:10.1016/j.ins.2013.11.008
[12] Chen, An entropy-based uncertainty measurement approach in neighborhood systems, Inf. Sci. 279 pp 239– (2014) · Zbl 1354.68261 · doi:10.1016/j.ins.2014.03.117
[13] DOI: 10.1038/srep08665 · doi:10.1038/srep08665
[14] Wang, Entropy, similarity measure and distance measure of vague soft sets and their relations, Inf. Sci. 244 pp 92– (2013) · Zbl 1355.68262 · doi:10.1016/j.ins.2013.05.013
[16] DOI: 10.1002/cplx.21539 · doi:10.1002/cplx.21539
[17] Dehmer, Information processing in complex networks: Graph entropy and information functionals, Appl. Math. Comput. 201 pp 82– (2008) · Zbl 1152.05361 · doi:10.1016/j.amc.2007.12.010
[18] Dragomir, Some bounds on entropy measures in information theory, Appl. Math. Lett. 10 pp 23– (1997) · Zbl 0906.94004 · doi:10.1016/S0893-9659(97)00028-1
[19] Dehmer, A History of Graph Entropy Measures, Inf. Sci. 1 pp 57– (2011) · Zbl 1204.94050 · doi:10.1016/j.ins.2010.08.041
[20] Chen, Entropy bounds for dendrimers, Appl. Math. Comput. 242 pp 462– (2014) · Zbl 1334.05137 · doi:10.1016/j.amc.2014.05.105
[21] Chen, A note on distance-based graph entropies, Entropy 16 pp 5416– (2014) · doi:10.3390/e16105416
[22] Soltani, The multiplicative version of the edge Wiener index, MATCH Commun. Math. Comput. Chem. 71 pp 407– (2014)
[23] Lin, Extremal Wiener index of trees with given number of vertices of even degree, MATCH Commun. Math. Comput. Chem. 72 pp 311– (2014)
[24] Skrekovski, Vertex version of the Wiener theorem, MATCH Commun. Math. Comput. Chem. 72 pp 295– (2014)
[25] Lin, On the Wiener index of trees with given number of branching vertices, MATCH Commun. Math. Comput. Chem. 72 pp 301– (2014)
[26] Al-Fozan, Computing Szeged index of certain nanosheets using partition technique, MATCH Commun. Math. Comput. Chem. 72 pp 339– (2014) · Zbl 1464.05051
[27] Da Fonseca, Counterexamples to a conjecture on Wiener index of common neighborhood graphs, MATCH Commun. Math. Comput. Chem. 72 pp 333– (2014)
[28] Knor, On Wiener index of common neighborhood graphs, MATCH Commun. Math. Comput. Chem. 72 pp 321– (2014)
[29] Feng, The hyper-Wiener index of graphs with given bipartition, Util. Math. 95 pp 23– (2014)
[30] Feng, The hyper-Wiener index of cacti, Util. Math. 93 pp 57– (2014)
[31] Ma, The Wiener polarity index of graph products, Ars Comb. 116 pp 235– (2014)
[32] Wiener, Structural determination of paraffin boiling points, J. Am. Chem. Soc. 69 pp 17– (1947) · doi:10.1021/ja01193a005
[33] Cao, Extremality of degree-based graph entropies, Inf. Sci. 278 pp 22– (2014) · Zbl 1354.94018 · doi:10.1016/j.ins.2014.03.133
[34] Cao, Degree-based entropies of networks revisited, Appl. Math. Comput. 261 pp 141– (2015) · Zbl 1410.94027 · doi:10.1016/j.amc.2015.03.046
[35] Gutman, An exceptional property of first Zagreb index, MATCH Commun. Math. Comput. Chem. 72 pp 733– (2014) · Zbl 1464.05074
[36] Azari, Zagreb indices of bridge and chain graphs, MATCH Commun. Math. Comput. Chem. 70 pp 921– (2013)
[37] Das, On Zagreb and Harary indices, MATCH Commun. Math. Comput. Chem. 70 pp 301– (2013)
[38] Lin, Vertices of degree two and the first Zagreb index of trees, MATCH Commun. Math. Comput. Chem. 72 pp 825– (2014)
[39] Vasilyev, Trees of given order and independence number with minimal first Zagreb index, MATCH Commun. Math. Comput. Chem. 72 pp 775– (2014)
[40] Ji, On reformulated Zagreb indices with respect to acyclic, unicyclic and bicyclic Graphs, MATCH Commun. Math. Comput. Chem. 72 pp 723– (2014)
[41] Xu, Maximizing the Zagreb Indices of (n, m)-Graphs, MATCH Commun. Math. Comput. Chem. 72 pp 641– (2014)
[42] Hu, Connected (n, m)-graphs with minimum and maximum zeroth-order general Randić index, Discret. Appl. Math. 155 pp 1044– (2007) · Zbl 1120.05046 · doi:10.1016/j.dam.2006.11.008
[43] Hu, On molecular graphs with smallest and greatest zeroth-order general Randić index, MATCH Commun. Math. Comput. Chem. 54 pp 425– (2005)
[44] Li, A survey on the Randić index, MATCH Commun. Math. Comput. Chem. 59 pp 127– (2008)
[45] Bollobás, Degree powers in graphs: the Erdös-Stone Theorem, Comb. Probab. Comput. 21 pp 89– (2012) · Zbl 1241.05021 · doi:10.1017/S0963548311000654
[46] DOI: 10.1007/s40840-014-0106-9 · Zbl 1322.05076 · doi:10.1007/s40840-014-0106-9
[47] Eagle, Network diversity and economic development, Science 328 pp 1029– (2010) · Zbl 1226.91053 · doi:10.1126/science.1186605
[48] DOI: 10.1186/1472-6807-10-18 · doi:10.1186/1472-6807-10-18
[49] Randić, On characterization of molecular branching, J. Am. Chem. Soc. 97 pp 6609– (1975) · doi:10.1021/ja00856a001
[50] Bollobás, Graphs of extremal weights, Ars Comb. 50 pp 225– (1998)
[51] Li, Mathematical Aspects of Randić-Type Molecular Structure Descriptors (2006)
[52] Li, Minimum general Randić index on chemical trees with given order and number of pendent vertices, MATCH Commun. Math. Comput. Chem. 60 pp 539– (2008)
[53] Li, Unicyclic graphs with maximum general Randić index for {\(\alpha\)} > 0, MATCH Commun. Math. Comput. Chem. 56 pp 557– (2006)
[54] Arezoomand, Zagreb Indices of the Generalized Hierarchical Product of Graphs, MATCH Commun. Math. Comput. Chem. 69 pp 131– (2013) · Zbl 1299.05281
[55] Kazemi, The second Zagreb index of molecular graphs with tree structure, MATCH Commun. Math. Comput. Chem. 72 pp 753– (2014) · Zbl 1464.05088
[56] Abdo, Estimating the spectral radius of a graph by the second Zagreb index, MATCH Commun. Math. Comput. Chem. 72 pp 741– (2014)
[57] da Fonseca, Further properties of the second Zagreb index, MATCH Commun. Math. Comput. Chem. 72 pp 655– (2014)
[58] Li, Best lower and upper bounds for the Randić index R-1 of chemical trees, MATCH Commun. Math. Comput. Chem. 52 pp 147– (2004)
[59] Lu, The Connectivity Index, MATCH Commun. Math. Comput. Chem. 51 pp 149– (2004)
[60] Dehmer, On extremal properties of graph entropies, MATCH Commun. Math. Comput. Chem. 68 pp 889– (2012)
[61] Dehmer, A Large Scale Analysis of Information-Theoretic Network Complexity Measures Using Chemical Structures, PLoS ONE 4 pp e8057– (2009) · doi:10.1371/journal.pone.0008057
[62] Tomescu, Maximum General Sum-Connectivity Index for Trees with Given Independence Number, MATCH Commun. Math. Comput. Chem. 72 pp 715– (2014)
[63] Du, On the general sum-connectivity index of trees, Appl. Math. Lett. 24 pp 402– (2011) · Zbl 1203.05033 · doi:10.1016/j.aml.2010.10.038
[64] Ahmadi, Disproving a Conjecture on Trees with Minimal Atom-Bond Connectivity Index, MATCH Commun. Math. Comput. Chem. 72 pp 685– (2014)
[65] Hosseini, Kragujevac trees with minimal atom-bond connectivity index, MATCH Commun. Math. Comput. Chem. 71 pp 5– (2014) · Zbl 1464.05082
[66] Rostami, Further Results on New Version of Atom-Bond Connectivity Index, MATCH Commun. Math. Comput. Chem. 71 pp 21– (2014) · Zbl 1464.05108
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.