MATHEMATICAL RELATION BETWEEN EXTENDED CONNECTIVITY AND EIGENVECTOR COEFFICIENTS

Authors
RUCKER C RUCKER G
Citation
C. Rucker et G. Rucker, MATHEMATICAL RELATION BETWEEN EXTENDED CONNECTIVITY AND EIGENVECTOR COEFFICIENTS, Journal of chemical information and computer sciences, 34(3), 1994, pp. 534-538
Citations number
15
Categorie Soggetti
Information Science & Library Science","Computer Application, Chemistry & Engineering","Computer Science Interdisciplinary Applications",Chemistry,"Computer Science Information Systems
Journal title
Journal of chemical information and computer sciences → ACNP
ISSN journal
00952338
Volume
34
Issue
3
Year of publication
1994
Pages
534 - 538
Database
ISI
SICI code
0095-2338(1994)34:3<534:MRBECA>2.0.ZU;2-U
Abstract
Formulas are derived for the limit distribution of weights of vertices in a graph as obtained from extended connectivities. A fundamental di fference between bipartite and nonbipartite graphs is seen: For the la tter the eventual distribution coincides with the one resulting from t he coefficients in the principal eigenvector. For the former, in contr ast, the last eigenvector also has to be taken into account, and there is no single limit distribution. This is the reason why in some bipar tite graphs the ranks derived from extended connectivities switch inde finitely for certain atoms.