Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
419110 | Discrete Applied Mathematics | 2014 | 5 Pages |
Abstract
The general sum-connectivity index of a graph GG is defined as χα(G)=∑uv∈E(G)(d(u)+d(v))αχα(G)=∑uv∈E(G)(d(u)+d(v))α, where d(u)d(u) denotes the degree of vertex uu in GG, and αα is a real number. In this paper, we characterize nn-vertex connected unicyclic graphs with girth k≥4k≥4, having the minimum, the second and the third minimum general sum-connectivity indices for n≥8n≥8 and −1≤α<0−1≤α<0.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Ioan Tomescu, Salma Kanwal,