𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Randić structure of a graph

✍ Scribed by Juan Rada; Carlos Uzcátegui

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
198 KB
Volume
128
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

✦ Synopsis

Let G be a collection of graphs with n vertices. We present a simple description of [G] = {H ∈ G: (H ) = (G)} where denotes the Randià c index. We associate to G a Q-linear map : Q m → Q k (for some integers k; m depending on G) such that the kernel of contains the necessary information to describe [G] in terms of linear equations. These results provide precise tools for analyzing the behavior of on a collection of graphs.

📜 SIMILAR VOLUMES

The generalized Randić index of trees
The generalized Randić index of trees
✍ Paul Balister; Béla Bollobás; Stefanie Gerke 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 241 KB

## Abstract The generalized Randić; index ${R}\_{-\alpha}(T)$ of a tree __T__ is the sum over the edges ${u}{v}$ of __T__ of $(d(u)d(v))^{-\alpha}$ where ${d}(x)$ is the degree of the vertex __x__ in __T__. For all $\alpha > 0$, we find the minimal constant $\beta\_{0}=\beta\_{0}(\alpha)$ such that

Novel applications of randić molecular c
Novel applications of randić molecular connectivity index on data reduction of chemical graphs
✍ Sherif El-Basil 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 429 KB

Benzenoid hydrocarbons are studied in terms of the much simpler caterpillar trees. Using molecular connectivity indices of the latter almost exact linear relations are obtained with natural logarithms of live properties of benzenoid hydrocarbons including all self-avoiding paths, conjugated circuits