On the sum-connectivity index of unicyclic graphs with k pendent vertices
Lists
Only you see this
Abstract
The sum-connectivity index R 0 (G) of a graph G is the sum of the weights (du +dv) i 1 2 of all edges uv of G, where du and dv are the degrees of the vertices u and v in G. This index was recently introduced in (B. Zhou, N. Trinajstic, On a novel connectivity index, J. Math. Chem. 46(2009), 1252{1270). In this paper, we give the sharp lower bound of the sum-connectivity index of n-vertex unicyclic graphs with k pendent vertices. AMS subject classiflcations: 05C05, 92E10
BibTeX
@inproceedings{chen2011sum,
author = {Jingjing Chen and Shuchao Li},
title = {{On the sum-connectivity index of unicyclic graphs with k pendent vertices}},
booktitle = {University},
year = {2011},
}Loading related content...