A Novel Method for Measuring the Structural Information Content of Networks

@article{Dehmer2008ANM,
  title={A Novel Method for Measuring the Structural Information Content of Networks},
  author={Matthias Dehmer},
  journal={Cybernetics and Systems},
  year={2008},
  volume={39},
  pages={825-842}
}
In this paper we first present a novel approach to determine the structural information content (graph entropy) of a network represented by an undirected and connected graph. Such entropic measures can be very important and useful to analyze and compare complex systems by means of networks. The novel graph entropy definition is based on local vertex functionals obtained by calculating j-spheres via the algorithm of Dijkstra. We state some lower and upper bounds of the defined graph entropy to… CONTINUE READING
Highly Cited
This paper has 41 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
24 Citations
25 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 24 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 25 references

Complexity in chemistry

  • D. Bonchev
  • Introduction and fundamentals. Taylor and Francis
  • 2003

Perfect graphs and graph entropy. An updated survey

  • G. Simonyi
  • Perfect Graphs,
  • 2001

Entropy and coding for graphs

  • J. I. Fujii, S. Yuki
  • Int. J. Math. Stat. Sci,
  • 1997

Similar Papers

Loading similar papers…