Degree-based indices computation for special chemical molecular structures using edge dividing method
From MaRDI portal
Publication:4597637
DOI10.21042/AMNS.2016.1.00009zbMath1432.05108MaRDI QIDQ4597637
Muhammad Reza Farahani, Wei Gao
Publication date: 14 December 2017
Published in: Applied Mathematics and Nonlinear Sciences (Search for Journal in Brave)
Related Items (12)
On some leap indices of Polycyclic Aromatic Hydrocarbons (PAHs) ⋮ Some reverse topological invariants for metal-organic networks ⋮ On certain degree-based irregularity indices of some nanotubes ⋮ Two tight independent set conditions for fractional \((g,f,m)\)-deleted graphs systems ⋮ Eccentric connectivity index in transformation graph \(G^{xy+}\) ⋮ Computing forgotten topological index of zero-divisor graphs of commutative rings ⋮ Computation of the fifth Geometric-Arithmetic Index for Polycyclic Aromatic Hydrocarbons PAH k ⋮ Note on forgotten topological index of chemical structure in drugs ⋮ Comparative study of vertex-edge based indices for semi-capped carbon nanotubes ⋮ M-Polynomial and topological indices of benzene ring embedded in p-type surface network ⋮ Irregularity indices for line graph of Dutch windmill graph ⋮ On the edge-version atom-bond connectivity and geometric arithmetic indices of certain graph operations
Cites Work
- The vertex version of weighted Wiener number for bicyclic molecular structures
- The harmonic index for graphs
- On ordinary generalized geometric-arithmetic index
- Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
- On topological indices of fullerenes
- Atom-bond connectivity index of trees
- Topological index based on the ratios of geometrical and arithmetical means of end-vertex degrees of edges
- The atom-bond connectivity index of catacondensed polyomino graphs
- On general sum-connectivity index
- The smallest Randić index for trees
- ON THE SCHULTZ POLYNOMIAL AND HOSOYA POLYNOMIAL OF CIRCUMCORONENE SERIES OF BENZENOID
- On atom-bond connectivity index
- A lower bound for the harmonic index of a graph with minimum degree at least two
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Degree-based indices computation for special chemical molecular structures using edge dividing method