𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Characterization of graphs having extremal Randić indices

✍ Scribed by Kinkar Ch. Das; Jin Ho Kwak

Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
160 KB
Volume
420
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Randić structure of a graph
Randić structure of a graph
✍ Juan Rada; Carlos Uzcátegui 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 198 KB

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

Fractal dimensions of DLA clusters using
Fractal dimensions of DLA clusters using cumulative Randićindices
✍ Jixiu Jiang; Weiguang Huang; Brynn Hibbert 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 130 KB

Diffusion-limited aggregation (DLA) clusters are similar to tree graphs which can be characterized by topological indices. It is demonstrated that the fractal dimensions of DLA clusters are statistically related to their graph invariants and can be determined by their topological indices, the cumula

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