Recently Randić  has proposed a set of new graph invariants: the graph valence shells. A valence shell s(u)k is the sum of valences (degrees) of all vertices placed at distance k - 1 from vertex u. The graph valence shell sk, is the sum of valence shells s(u)k. Consider an acyclic graph T. It has been proved that sk = pk - 1 + Pk, where pk denotes the number of paths of length k in T.
|Number of pages||8|
|Publication status||Published - Dec 1 2001|
ASJC Scopus subject areas
- Computer Science Applications
- Computational Theory and Mathematics
- Applied Mathematics