메뉴 건너뛰기




Volumn 39, Issue 8, 2008, Pages 825-842

A novel method for measuring the structural information content of networks

Author keywords

Entropy; Graphs; Structural information; Structural information content; Topological entropy

Indexed keywords

ENTROPY;

EID: 56049106121     PISSN: 01969722     EISSN: 10876553     Source Type: Journal    
DOI: 10.1080/01969720802435925     Document Type: Article
Times cited : (31)

References (29)
  • 2
    • 0002183826 scopus 로고
    • On the complexity of graphs and molecules
    • Bertz, S. H. 1983. On the complexity of graphs and molecules. Bull. Math. Biol. 45: 849-855.
    • (1983) Bull. Math. Biol , vol.45 , pp. 849-855
    • Bertz, S.H.1
  • 3
    • 0018060226 scopus 로고
    • Some considerations on the entropy in cybernetic systems
    • Birlea, S. 1978. Some considerations on the entropy in cybernetic systems. Econ. Comput. Econ. Cybern. Stud. Res. 4: 65-74.
    • (1978) Econ. Comput. Econ. Cybern. Stud. Res , vol.4 , pp. 65-74
    • Birlea, S.1
  • 4
    • 0012430176 scopus 로고
    • Information indices for atoms and molecules
    • Bonchev, D. 1979. Information indices for atoms and molecules. MATCH 7: 65-113.
    • (1979) MATCH , vol.7 , pp. 65-113
    • Bonchev, D.1
  • 9
    • 0002959731 scopus 로고
    • Entropy splitting for antiblocking corners and perfect graphs
    • Csiszár, I., Körner, J., Lovász, L., Marto, K., and Simonyi, G. 1990. Entropy splitting for antiblocking corners and perfect graphs. Combinatorica 10(1): 27-40.
    • (1990) Combinatorica , vol.10 , Issue.1 , pp. 27-40
    • Csiszár, I.1    Körner, J.2    Lovász, L.3    Marto, K.4    Simonyi, G.5
  • 10
    • 34147120474 scopus 로고
    • A note on two problems in connection with graphs
    • Dijkstra, E. W. 1959. A note on two problems in connection with graphs. Numerische Math. 1: 269-271.
    • (1959) Numerische Math , vol.1 , pp. 269-271
    • Dijkstra, E.W.1
  • 12
    • 34250623666 scopus 로고    scopus 로고
    • Information theoretic measures of UHG graphs with low computational complexity
    • in press
    • Enimert-Streib, F. and Dehmer, M. 2007. Information theoretic measures of UHG graphs with low computational complexity. Applied Mathematics and Computation, in press.
    • (2007) Applied Mathematics and Computation
    • Enimert-Streib, F.1    Dehmer, M.2
  • 13
    • 49849086993 scopus 로고    scopus 로고
    • Entropy and coding for graphs
    • Fujii, J. I. and Yuki, S. 1997. Entropy and coding for graphs. Int. J. Math. Stat. Sci. 6(1): 63-77.
    • (1997) Int. J. Math. Stat. Sci , vol.6 , Issue.1 , pp. 63-77
    • Fujii, J.I.1    Yuki, S.2
  • 16
    • 0003780715 scopus 로고
    • Addison Wesley Publishing Company
    • Harary, F. 1969. Graph Theory. Addison Wesley Publishing Company.
    • (1969) Graph Theory
    • Harary, F.1
  • 19
    • 0014296467 scopus 로고
    • Entropy and the complexity of graphs ii: The information content of digraphs and infinite graphs
    • Mowshowitz, A. 1968a. Entropy and the complexity of graphs ii: The information content of digraphs and infinite graphs. Bull. Math. Biophys. 30: 225-240.
    • (1968) Bull. Math. Biophys , vol.30 , pp. 225-240
    • Mowshowitz, A.1
  • 20
    • 51249190020 scopus 로고
    • Entropy and the complexity of graphs iii: Graphs with prescribed information content
    • Mowshowitz, A. 1968b. Entropy and the complexity of graphs iii: Graphs with prescribed information content. Bull. Math. Biophys. 30: 387-414.
    • (1968) Bull. Math. Biophys , vol.30 , pp. 387-414
    • Mowshowitz, A.1
  • 21
    • 51249189854 scopus 로고
    • Entropy and the complexity of graphs iv: Entropy measures and graphical structure
    • Mowshowitz, A. 1968c. Entropy and the complexity of graphs iv: Entropy measures and graphical structure. Bull. Math. Biophys. 30: 533-546.
    • (1968) Bull. Math. Biophys , vol.30 , pp. 533-546
    • Mowshowitz, A.1
  • 22
    • 0014257683 scopus 로고
    • Entropy and the complexity of the graphs i: An index of the relative complexity of a graph
    • Mowshowitz, A. 1968d. Entropy and the complexity of the graphs i: An index of the relative complexity of a graph. Bull. Math. Biophys. 30: 175-204.
    • (1968) Bull. Math. Biophys , vol.30 , pp. 175-204
    • Mowshowitz, A.1
  • 23
    • 51649200028 scopus 로고
    • Life, information theory, and topology
    • Rashewsky, N. 1955. Life, information theory, and topology. Bull. Math. Biophys. 11:229-235.
    • (1955) Bull. Math. Biophys , vol.11 , pp. 229-235
    • Rashewsky, N.1
  • 24
    • 56049104529 scopus 로고
    • Einführung in die Kybernetik
    • Sachsse, H. 1971. Einführung in die Kybernetik. Vieweg Verlag.
    • (1971) Vieweg Verlag
    • Sachsse, H.1
  • 26
    • 0347458063 scopus 로고    scopus 로고
    • Perfect graphs and graph entropy. An updated survey
    • edited by Ramirez-Alfonsin, J. and Reed, B. John Wiley & Sons, pp
    • Simonyi, G. 2001. Perfect graphs and graph entropy. An updated survey. In Perfect Graphs, edited by Ramirez-Alfonsin, J. and Reed, B. John Wiley & Sons, pp. 293-328.
    • (2001) Perfect Graphs , pp. 293-328
    • Simonyi, G.1
  • 27
    • 0000401765 scopus 로고
    • Metrical analysis of graphs
    • Skorobogatov, V. A. and Dobrynin, A. A. 1988. Metrical analysis of graphs. MATCH 23: 105-155.
    • (1988) MATCH , vol.23 , pp. 105-155
    • Skorobogatov, V.A.1    Dobrynin, A.A.2
  • 28
    • 51649221175 scopus 로고
    • A note on the information content of graphs
    • Trucco, E. 1956. A note on the information content of graphs. Bulletin of Mathematical Biology 18(2): 129-135.
    • (1956) Bulletin of Mathematical Biology , vol.18 , Issue.2 , pp. 129-135
    • Trucco, E.1


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