Minimum variable connectivity index of trees of a fixed order
Summary: The connectivity index, introduced by the chemist Milan Randić in 1975, is one of the topological indices with many applications. In the first quarter of 1990s, Randić proposed the variable connectivity index by extending the definition of the connectivity index. The variable connectivity index for graph \(G\) is defined as \({\sum\nolimits_{v w \in E \left( G\right)} \left( \left( d \left( v\right) + \gamma\right) \left( d \left( w\right) + \gamma\right)\right)^{- 1 / 2}}\), where \(\gamma\) is a nonnegative real number, \(E\left( G\right)\) is the edge set of \(G\), and \(d\left( t\right)\) denotes the degree of an arbitrary vertex \(t\) in \(G\). Soon after the innovation of the variable connectivity index, its various chemical applications have been reported in different papers. However, to the best of the authors' knowledge, mathematical properties of the variable connectivity index, for \(\gamma>0\), have not yet been discussed explicitly in any paper. The main purpose of the present paper is to fill this gap by studying this topological index in a mathematical point of view. More precisely, in this paper, we prove that the star graph has the minimum variable connectivity index among all trees of a fixed order \(n\), where \(n\geq4\).
- A unified approach to bounds for topological indices on trees and applications
- Bounds for the general sum-connectivity index of composite graphs
- scientific article; zbMATH DE number 4074878 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- On generalized atom-bond connectivity index of cacti
- On history of the Randić index and emerging hostility toward chemical graph theory
- scientific article; zbMATH DE number 7090171
- On the general zeroth-order Randić index of bargraphs
- On the generalized adjacency, Laplacian and signless Laplacian spectra of the weighted edge corona networks
- On the minimum variable connectivity index of unicyclic graphs with a given order
- Some relations and bounds for the general first Zagreb index
- Valency-based topological descriptors and structural property of the generalized Sierpiński networks
This page was built for publication: Minimum variable connectivity index of trees of a fixed order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2194595)
