메뉴 건너뛰기




Volumn 278, Issue , 2014, Pages 22-33

Extremality of degree-based graph entropies

Author keywords

Degree power; Degree sequence; Entropy; Graph entropy; Information theory; Shannon's entropy

Indexed keywords

ARTIFICIAL INTELLIGENCE; ENTROPY; INFORMATION THEORY;

EID: 84901799479     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2014.03.133     Document Type: Article
Times cited : (170)

References (78)
  • 2
    • 0042250676 scopus 로고
    • Graphs with maximal number of adjacent pairs of edges
    • R. Ahlswede, and G.O.H. Katona Graphs with maximal number of adjacent pairs of edges Acta Math. Acad. Sci. Hungar. 32 1978 97 120
    • (1978) Acta Math. Acad. Sci. Hungar. , vol.32 , pp. 97-120
    • Ahlswede, R.1    Katona, G.O.H.2
  • 3
    • 9444296174 scopus 로고
    • Distance connectivity index
    • A.T. Balaban Distance connectivity index Chem. Phys. Lett. 89 1982 399 404
    • (1982) Chem. Phys. Lett. , vol.89 , pp. 399-404
    • Balaban, A.T.1
  • 4
    • 35649010951 scopus 로고    scopus 로고
    • On the variance of Shannon products of graphs
    • J. Balogh, and C. Smyth On the variance of Shannon products of graphs Discrete Appl. Math. 156 2008 110 118
    • (2008) Discrete Appl. Math. , vol.156 , pp. 110-118
    • Balogh, J.1    Smyth, C.2
  • 5
    • 0346263337 scopus 로고    scopus 로고
    • Two path extremal graphs and an application to a Ramsey-type problem
    • O.D. Byer Two path extremal graphs and an application to a Ramsey-type problem Discrete Math. 196 1999 51 64
    • (1999) Discrete Math. , vol.196 , pp. 51-64
    • Byer, O.D.1
  • 6
    • 0038141206 scopus 로고    scopus 로고
    • An upper bound on the sum of squares of degrees in a hypergraph
    • C. Bey An upper bound on the sum of squares of degrees in a hypergraph Discrete Math. 269 2003 259 263
    • (2003) Discrete Math. , vol.269 , pp. 259-263
    • Bey, C.1
  • 8
    • 0032411939 scopus 로고    scopus 로고
    • Graphs of extremal weights
    • B. Bollobás, and P. Erdös Graphs of extremal weights Ars Combin. 50 1998 225 233
    • (1998) Ars Combin. , vol.50 , pp. 225-233
    • Bollobás, B.1    Erdös, P.2
  • 9
    • 29144484952 scopus 로고    scopus 로고
    • Degree powers in graphs with forbidden subgraphs
    • B. Bollobás, and V. Nikiforov Degree powers in graphs with forbidden subgraphs Electron. J. Comb. 11 2004 R42
    • (2004) Electron. J. Comb. , vol.11 , pp. 42
    • Bollobás, B.1    Nikiforov, V.2
  • 10
    • 84859325133 scopus 로고    scopus 로고
    • Degree powers in graphs: The Erdös-Stone theorem
    • B. Bollobás, and V. Nikiforov Degree powers in graphs: the Erdös-Stone theorem Comb. Probab. Comput. 21 2012 89 105
    • (2012) Comb. Probab. Comput. , vol.21 , pp. 89-105
    • Bollobás, B.1    Nikiforov, V.2
  • 13
    • 0343071989 scopus 로고
    • Information theory, distance matrix and molecular branching
    • D. Bonchev, and N. Trinajstić Information theory, distance matrix and molecular branching J. Chem. Phy. 67 1977 4517 4533
    • (1977) J. Chem. Phy. , vol.67 , pp. 4517-4533
    • Bonchev, D.1    Trinajstić, N.2
  • 15
    • 0039606459 scopus 로고    scopus 로고
    • Graphs with large variance
    • Y. Caro, and R. Yuster Graphs with large variance Ars Combin. 57 2000 151 162
    • (2000) Ars Combin. , vol.57 , pp. 151-162
    • Caro, Y.1    Yuster, R.2
  • 16
    • 4043059175 scopus 로고    scopus 로고
    • A Turán type problem concerning the powers of the degrees of a graph
    • Y. Caro, and R. Yuster A Turán type problem concerning the powers of the degrees of a graph Electron. J. Comb. 7 2000 R47
    • (2000) Electron. J. Comb. , vol.7 , pp. 47
    • Caro, Y.1    Yuster, R.2
  • 17
    • 33746672480 scopus 로고    scopus 로고
    • Sums of powers of the degrees of a graph
    • S.M. Cioabǎ Sums of powers of the degrees of a graph Discrete Math. 306 2006 1959 1964
    • (2006) Discrete Math. , vol.306 , pp. 1959-1964
    • Cioabǎ, S.M.1
  • 19
    • 0037904600 scopus 로고    scopus 로고
    • An upper bound on the sum of squares of degrees in a graph
    • D. de Caen An upper bound on the sum of squares of degrees in a graph Discrete Math. 185 1998 245 248
    • (1998) Discrete Math. , vol.185 , pp. 245-248
    • De Caen, D.1
  • 20
    • 44749091859 scopus 로고    scopus 로고
    • Information processing in complex networks: Graph entropy and information functionals
    • M. Dehmer Information processing in complex networks: graph entropy and information functionals Appl. Math. Comput. 201 2008 82 94
    • (2008) Appl. Math. Comput. , vol.201 , pp. 82-94
    • Dehmer, M.1
  • 21
    • 40049085450 scopus 로고    scopus 로고
    • Structural information content of networks: Graph entropy based on local vertex functionals
    • M. Dehmer, and F. Emmert-Streib Structural information content of networks: graph entropy based on local vertex functionals Comput. Biol. Chem. 32 2 2008 131 138
    • (2008) Comput. Biol. Chem. , vol.32 , Issue.2 , pp. 131-138
    • Dehmer, M.1    Emmert-Streib, F.2
  • 22
    • 52649173207 scopus 로고    scopus 로고
    • Entropy bounds for molecular hierarchical networks
    • M. Dehmer, S. Borgert, and F. Emmert-Streib Entropy bounds for molecular hierarchical networks PLoS ONE 3 8 2008 e3079
    • (2008) PLoS ONE , vol.3 , Issue.8 , pp. 3079
    • Dehmer, M.1    Borgert, S.2    Emmert-Streib, F.3
  • 24
    • 77958091914 scopus 로고    scopus 로고
    • A history of graph entropy measures
    • M. Dehmer, and A. Mowshowitz A history of graph entropy measures Inform. Sci. 181 2011 57 78
    • (2011) Inform. Sci. , vol.181 , pp. 57-78
    • Dehmer, M.1    Mowshowitz, A.2
  • 26
    • 68149167631 scopus 로고    scopus 로고
    • On entropy-based molecular descriptors: Statistical analysis of real and synthetic chemical structures
    • M. Dehmer, K. Varmuza, S. Borgert, and F. Emmert-Streib On entropy-based molecular descriptors: statistical analysis of real and synthetic chemical structures J. Chem. Inf. Model. 49 2009 1655 1663
    • (2009) J. Chem. Inf. Model. , vol.49 , pp. 1655-1663
    • Dehmer, M.1    Varmuza, K.2    Borgert, S.3    Emmert-Streib, F.4
  • 28
    • 0008449781 scopus 로고    scopus 로고
    • Some bounds on entropy measures in information theory
    • S. Dragomir, and C. Goh Some bounds on entropy measures in information theory Appl. Math. Lett. 10 1997 23 28
    • (1997) Appl. Math. Lett. , vol.10 , pp. 23-28
    • Dragomir, S.1    Goh, C.2
  • 29
    • 84860700562 scopus 로고    scopus 로고
    • Exploring statistical and population aspects of network complexity
    • F. Emmert-Streib, and M. Dehmer Exploring statistical and population aspects of network complexity PLoS ONE 7 2012 e34523
    • (2012) PLoS ONE , vol.7 , pp. 34523
    • Emmert-Streib, F.1    Dehmer, M.2
  • 31
    • 0012974874 scopus 로고
    • On the graph theorem of Turán
    • (In Hungarian, MR46# 7090)
    • P. Erdös On the graph theorem of Turán Matematikai Lapok 21 1970 249 251 (In Hungarian, MR46# 7090)
    • (1970) Matematikai Lapok , vol.21 , pp. 249-251
    • Erdös, P.1
  • 32
    • 62849120398 scopus 로고    scopus 로고
    • Number of walks and degree powers in a graph
    • M.A. Fiol, and E. Garriga Number of walks and degree powers in a graph Discrete Math. 309 2009 2613 2614
    • (2009) Discrete Math. , vol.309 , pp. 2613-2614
    • Fiol, M.A.1    Garriga, E.2
  • 33
    • 33645320524 scopus 로고    scopus 로고
    • Moments of graphs in monotone families
    • Z. Füredi, and A. Kündgen Moments of graphs in monotone families J. Graph Theory 51 2006 37 48
    • (2006) J. Graph Theory , vol.51 , pp. 37-48
    • Füredi, Z.1    Kündgen, A.2
  • 35
    • 0000549907 scopus 로고
    • On sets of acquaintances and strangers at any party
    • A.W. Goodman On sets of acquaintances and strangers at any party Amer. Math. Monthly 66 1959 778 783
    • (1959) Amer. Math. Monthly , vol.66 , pp. 778-783
    • Goodman, A.W.1
  • 36
  • 39
    • 0028498920 scopus 로고
    • Selected properties of the Schultz molecular topological index
    • I. Gutman Selected properties of the Schultz molecular topological index J. Chem. Inf. Comput. Sci. 34 1994 1087 1089
    • (1994) J. Chem. Inf. Comput. Sci. , vol.34 , pp. 1087-1089
    • Gutman, I.1
  • 40
    • 33846174306 scopus 로고    scopus 로고
    • Chemical graph theory - The mathematical connection
    • I. Gutman Chemical graph theory - the mathematical connection Adv. Quantum Chem. 51 2006 125 138
    • (2006) Adv. Quantum Chem. , vol.51 , pp. 125-138
    • Gutman, I.1
  • 44
    • 0001219776 scopus 로고
    • Topological index: A newly proposed quantity characterizing the topological nature of structural isomers of saturated hydrocarbons
    • H. Hosoya Topological index: a newly proposed quantity characterizing the topological nature of structural isomers of saturated hydrocarbons Bull. Chem. Soc. Jpn. 44 1971 2332 2339
    • (1971) Bull. Chem. Soc. Jpn. , vol.44 , pp. 2332-2339
    • Hosoya, H.1
  • 45
    • 33947237755 scopus 로고    scopus 로고
    • Connected (n,m)-graphs with minimum and maximum zeroth-order general Randić index
    • Y. Hu, X. Li, Y. Shi, and T. Xu Connected (n,m)-graphs with minimum and maximum zeroth-order general Randić index Discrete Appl. Math. 155 2007 1044 1054
    • (2007) Discrete Appl. Math. , vol.155 , pp. 1044-1054
    • Hu, Y.1    Li, X.2    Shi, Y.3    Xu, T.4
  • 46
    • 29344448044 scopus 로고    scopus 로고
    • On molecular graphs with smallest and greatest zeroth-order general Randić index
    • Y. Hu, X. Li, Y. Shi, T. Xu, and I. Gutman On molecular graphs with smallest and greatest zeroth-order general Randić index MATCH Commun. Math. Comput. Chem. 54 2005 425 434
    • (2005) MATCH Commun. Math. Comput. Chem. , vol.54 , pp. 425-434
    • Hu, Y.1    Li, X.2    Shi, Y.3    Xu, T.4    Gutman, I.5
  • 47
    • 33746755216 scopus 로고    scopus 로고
    • Minimizer graphs for a class of extremal problems
    • D. Ismailescu, and D. Stefanica Minimizer graphs for a class of extremal problems J. Graph Theory 39 2002 230 240
    • (2002) J. Graph Theory , vol.39 , pp. 230-240
    • Ismailescu, D.1    Stefanica, D.2
  • 48
    • 51249187583 scopus 로고
    • Rearrangements of (0-1) matrices
    • M. Katz Rearrangements of (0-1) matrices Israel J. Math. 9 1971 13 15
    • (1971) Israel J. Math. , vol.9 , pp. 13-15
    • Katz, M.1
  • 51
    • 0041370197 scopus 로고    scopus 로고
    • The meaning of molecular connectivity: A bimolecular accessibility model
    • L.B. Kier, and L.H. Hall The meaning of molecular connectivity: a bimolecular accessibility model Croat. Chem. Acta 75 2002 371 382
    • (2002) Croat. Chem. Acta , vol.75 , pp. 371-382
    • Kier, L.B.1    Hall, L.H.2
  • 56
    • 12444342998 scopus 로고    scopus 로고
    • Trees with the first three smallest and largest generalized topological indices
    • X. Li, and H. Zhao Trees with the first three smallest and largest generalized topological indices MATCH Commun. Math. Comput. Chem. 50 2004 57 62
    • (2004) MATCH Commun. Math. Comput. Chem. , vol.50 , pp. 57-62
    • Li, X.1    Zhao, H.2
  • 57
    • 0036972875 scopus 로고    scopus 로고
    • An extremal problem on degree sequences of graphs
    • N. Linial, and E. Rozenman An extremal problem on degree sequences of graphs Graphs Combin. 18 2002 573 582
    • (2002) Graphs Combin. , vol.18 , pp. 573-582
    • Linial, N.1    Rozenman, E.2
  • 58
    • 0014257683 scopus 로고
    • Entropy and the complexity of the graphs I: An index of the relative complexity of a graph
    • A. Mowshowitz Entropy and the complexity of the graphs I: an index of the relative complexity of a graph Bull. Math. Biophys. 30 1968 175 204
    • (1968) Bull. Math. Biophys. , vol.30 , pp. 175-204
    • Mowshowitz, A.1
  • 59
    • 0014296467 scopus 로고
    • Entropy and the complexity of graphs II: The information content of digraphs and infinite graphs
    • A. Mowshowitz Entropy and the complexity of graphs II: the information content of digraphs and infinite graphs Bull. Math. Biophys. 30 1968 225 240
    • (1968) Bull. Math. Biophys. , vol.30 , pp. 225-240
    • Mowshowitz, A.1
  • 60
    • 51249190020 scopus 로고
    • Entropy and the complexity of graphs III: Graphs with prescribed information content
    • A. Mowshowitz Entropy and the complexity of graphs III: graphs with prescribed information content Bull. Math. Biophys. 30 1968 387 414
    • (1968) Bull. Math. Biophys. , vol.30 , pp. 387-414
    • Mowshowitz, A.1
  • 61
    • 51249189854 scopus 로고
    • Entropy and the complexity of graphs IV: Entropy measures and graphical structure
    • A. Mowshowitz Entropy and the complexity of graphs IV: entropy measures and graphical structure Bull. Math. Biophys. 30 1968 533 546
    • (1968) Bull. Math. Biophys. , vol.30 , pp. 533-546
    • Mowshowitz, A.1
  • 62
    • 70349503930 scopus 로고    scopus 로고
    • Degree powers in graphs with a forbidden even cycle
    • V. Nikiforov Degree powers in graphs with a forbidden even cycle Electron. J. Comb. 16 2009 R107
    • (2009) Electron. J. Comb. , vol.16 , pp. 107
    • Nikiforov, V.1
  • 63
    • 0039309747 scopus 로고    scopus 로고
    • A conjecture of Goodman and the multiplicities of graphs
    • D. Olpp A conjecture of Goodman and the multiplicities of graphs Australasian J. Combin. 14 1996 267 282
    • (1996) Australasian J. Combin. , vol.14 , pp. 267-282
    • Olpp, D.1
  • 64
    • 0033461042 scopus 로고    scopus 로고
    • (n, e) -Graphs with maximum sum of squares of degrees
    • U.N. Peled, R. Pedreschi, and Q. Sterbini (n, e) -Graphs with maximum sum of squares of degrees J. Graph Theory 31 1999 283 295
    • (1999) J. Graph Theory , vol.31 , pp. 283-295
    • Peled, U.N.1    Pedreschi, R.2    Sterbini, Q.3
  • 65
    • 0001390587 scopus 로고
    • The degree variance: An index of graph heterogeneity
    • T.A.B. Snijders The degree variance: an index of graph heterogeneity Social Netw. 3 1981 163 174
    • (1981) Social Netw. , vol.3 , pp. 163-174
    • Snijders, T.A.B.1
  • 66
    • 33644851967 scopus 로고    scopus 로고
    • Information theory of complex networks: On evolution and architectural constraints
    • R.V. Sol, and S.i. Valverde Information theory of complex networks: on evolution and architectural constraints Complex Netw. Lect. Notes Phys. 650 2004 189 207
    • (2004) Complex Netw. Lect. Notes Phys. , vol.650 , pp. 189-207
    • Sol, R.V.1
  • 67
    • 51649200028 scopus 로고
    • Life, information theory, and topology
    • N. Rashevsky Life, information theory, and topology Bull. Math. Biophys. 17 1955 229 235
    • (1955) Bull. Math. Biophys. , vol.17 , pp. 229-235
    • Rashevsky, N.1
  • 68
    • 8644280181 scopus 로고
    • On characterization of molecular branching
    • M. Randić On characterization of molecular branching J. Am. Chem. Soc. 97 1975 6609 6615
    • (1975) J. Am. Chem. Soc. , vol.97 , pp. 6609-6615
    • Randić, M.1
  • 69
    • 42149156590 scopus 로고    scopus 로고
    • On history of the Randić index and emerging hostility toward chemical graph theory
    • M. Randić On history of the Randić index and emerging hostility toward chemical graph theory MATCH Commun. Math. Comput. Chem. 59 2008 5 124
    • (2008) MATCH Commun. Math. Comput. Chem. , vol.59 , pp. 5-124
    • Randić, M.1
  • 71
    • 0037116449 scopus 로고    scopus 로고
    • Entropy lower bounds for quantum decision tree complexity
    • Y. Shi Entropy lower bounds for quantum decision tree complexity Inf. Process. Lett. 81 2002 23 27
    • (2002) Inf. Process. Lett. , vol.81 , pp. 23-27
    • Shi, Y.1
  • 72
    • 84867287480 scopus 로고    scopus 로고
    • Recent developments in extremal combinatorics: Ramsey and turn type problems
    • B. Sudakov, Recent developments in extremal combinatorics: Ramsey and turn type problems, in: Proceedings of the International Congress of Mathematicians, vol. IV, 2010, pp. 2579-2606.
    • (2010) Proceedings of the International Congress of Mathematicians , vol.4 , pp. 2579-2606
    • Sudakov, B.1
  • 74
    • 4043145878 scopus 로고    scopus 로고
    • Network structure entropy and its application to scale-free networks
    • Y.J. Tan, and J. Wu Network structure entropy and its application to scale-free networks Syst. Eng.-Theory Pract. 6 2004 1 3
    • (2004) Syst. Eng.-Theory Pract. , vol.6 , pp. 1-3
    • Tan, Y.J.1    Wu, J.2
  • 76
    • 51649221175 scopus 로고
    • A note on the information content of graphs
    • E. Trucco A note on the information content of graphs Bull. Math. Biol. 18 1965 129 135
    • (1965) Bull. Math. Biol. , vol.18 , pp. 129-135
    • Trucco, E.1
  • 78
    • 8544254107 scopus 로고
    • Structural determination of paraffin boiling points
    • H. Wiener Structural determination of paraffin boiling points J. Am. Chem. Soc. 69 1947 17 20
    • (1947) J. Am. Chem. Soc. , vol.69 , pp. 17-20
    • Wiener, H.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.