Structural differentiation of graphs using Hosoya-based indices

Matthias Dehmer; Abbe Mowshowitz; Yongtang Shi

doi:10.1371/journal.pone.0102459

Structural differentiation of graphs using Hosoya-based indices

PLoS One. 2014 Jul 14;9(7):e102459. doi: 10.1371/journal.pone.0102459. eCollection 2014.

Authors

Matthias Dehmer¹, Abbe Mowshowitz², Yongtang Shi³

Affiliations

¹ Department of Computer Science, Universität der Bundeswehr München, Neubiberg, Germany; Institute for Bioinformatics and Translational Research, UMIT, Hall in Tyrol, Austria.
² Department of Computer Science, The City College of New York (CUNY), New York, New York, United States of America.
³ Center for Combinatorics and LPMC-TJKLC, Nankai University, Tianjin, China; College of Computer and Control Engineering, Nankai University, Tianjin, China.

Abstract

In this paper, we introduce the Hosoya-Spectral indices and the Hosoya information content of a graph. The first measure combines structural information captured by partial Hosoya polynomials and graph spectra. The latter is a graph entropy measure which is based on blocks consisting of vertices with the same partial Hosoya polynomial. We evaluate the discrimination power of these quantities by interpreting numerical results.

Publication types

Research Support, Non-U.S. Gov't

MeSH terms

Algorithms
Computer Graphics
Models, Theoretical*
Pattern Recognition, Automated / methods

Grants and funding

Matthias Dehmer thanks the Austrian Science Funds for supporting this work (project P26142). Matthias Dehmer gratefully acknowledges financial support from the German Federal Ministry of Education and Research (BMBF) (project RiKoV, Grant No. 13N12304). Yongtang Shi are supported by NSFC, PCSIRT, China Postdoctoral Science Foundation and China Scholarship Council. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.