Abstract
Numerical graph theoretic invariants or topological indices (TIs) and principal components (PCs) derived from TIs have been used in discriminating a set of isospectral graphs. Results show that lower order connectivity and information theoretic TIs suffer from a high degree of redundancy, whereas higher order indices can characterize the graphs reasonably well. On the other hand, PCs derived from the TIs had no redundancy for the set of isospectral graphs studied.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 367-373 |
| Number of pages | 7 |
| Journal | Journal of chemical information and computer sciences |
| Volume | 38 |
| Issue number | 3 |
| DOIs | |
| State | Published - 1998 |