Abstract
Formulas are derived for the limit distribution of weights of vertices in a graph as obtained from extended connectivities. A fundamental difference between bipartite and nonbipartite graphs is seen: For the latter the eventual distribution coincides with the one resulting from the coefficients in the principal eigenvector. For the former, in contrast, the last eigenvector also has to be taken into account, and there is no single limit distribution. This is the reason why in some bipartite graphs the ranks derived from extended connectivities switch indefinitely for certain atoms.
| Original language | English |
|---|---|
| Journal | Journal of Chemical Information and Computer Science |
| Volume | 34 |
| Issue number | 3 |
| Pages (from-to) | 534-538 |
| Number of pages | 5 |
| ISSN | 0095-2338 |
| DOIs | |
| Publication status | Published - 01.05.1994 |
| Externally published | Yes |
Bibliographical note
Print Edition ISSN: 1549-9596. Web Edition ISSN: 1549-960XDruckausg. 45.2004 -: Journal of chemical information and modeling
Research areas and keywords
- Chemistry
ASJC Scopus Subject Areas
- Computational Theory and Mathematics
- Chemistry(all)
- Computer Science Applications
- Information Systems
Fingerprint
Dive into the research topics of 'Mathematical relation between extended connectivity and eigenvector coefficients.'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver