No Detail Found!

General Randi c´ index of unicyclic graphs with given number of pendant vertices

Author(s)
Tomas Vetrik Department of Mathematics and Applied Mathematics, University of the Free State,Bloemfontein,South Africa
Selvaraj Balachandran Department of Mathematics, School of Arts, Sciences and Humanities, SASTRA Deemed University,Thanjavur,India
Abstract
For a 2 R and a graph G, the general Randic´ index is defined as Ra(G) = Puv2E(G)[dG(u)dG(v)]a, where E(G) is the edge set of G, and dG(u) and dG(v) are degrees of the vertices u and v in G, respectively. For 0:64 a < 0, we give lower bounds on the general Randic´ index for unicyclic graphs with given number of pendant vertices, and with given order and number of pendant vertices. The extremal graphs are presented as well. Lower bounds on the classical Randic´ index are corollaries of our bounds on the general Randic´ index.
Publication Details
Page(s) 83-88
Published Journal: Discrete Mathematics Letters, Volume: 8, Issue: 0, Year: 2022

Request the full text from PASTIC

Keywords
general Randic´ index, pendant vertex, degree, unicyclic graph
0

Citations

0

Downloads

33

Views