Randić ordering of chemical trees

DOI10.1016/j.dam.2005.02.014zbMath1071.92050OpenAlexW1969710901MaRDI QIDQ2565859

Juan Rada, Carlos Uzcátegui

Publication date: 28 September 2005

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2005.02.014

zbMATH Keywords

connectivity index

Mathematics Subject Classification ID

Partial orders, general (06A06) Trees (05C05) Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items (10)

Extremal values of vertex-degree-based topological indices of chemical trees ⋮ Sharp upper bounds on Zagreb indices of bicyclic graphs with a given matching number ⋮ Sharp bounds on the zeroth-order general randić indices of conjugated bicyclic graphs ⋮ Characterizing trees with large Laplacian energy ⋮ Ordering trees and graphs with few cycles by algebraic connectivity ⋮ On the extremal Zagreb indices of graphs with cut edges ⋮ On the maximum Zagreb indices of graphs with \(k\) cut vertices ⋮ Sharp bounds for Zagreb indices of maximal outerplanar graphs ⋮ Zeroth-order general Randić index of cactus graphs ⋮ On a novel connectivity index

Uses Software

• AutoGraphiX

Cites Work

• Unnamed Item
• Unnamed Item
• Variable neighborhood search for extremal graphs. I: The AutoGraphiX system

This page was built for publication: Randić ordering of chemical trees