On the Randić Index and Extremal Cacti

Hua Wang, Daniel Gray

Research output: Contribution to journalArticlepeer-review

Abstract

<p> The Randi&cacute; index of a graph G is the sum of ((d(u))(d(v))) &alpha; over all edges uv of G, where d(v) denotes the degree of v in G, &alpha;&ne;0. Earlier in [Discrete Appl. Math. 156, No. 10, 1725&ndash;1735 (2008; Zbl 1152.05320)] A. Lin, R. Juo and Y. Zha provided a sharp lower bound for the Randi&cacute; index of cacti with given number of pendant edges, in the case of &alpha;=-1 2. In this short note we seek to provide some results regarding the extremal cacti with respect to general Randi&cacute; indices (i.e., 0&ne;&alpha;&isin;[-1,1]) for cacti with given number of vertices, pendant edges and cycles. We conjecture that the extremal cacti in this category must be in a special group, a formula for the Randi&cacute; index of these special cacti is provided. More generally, our approach lead to a single inequality for any value of &alpha;, the verification of which will result in a simple proof of our conjecture for the specific value of &alpha;. As an application, characterizations of the extremal cacti for the weight (special case of the Randi&cacute; index when &alpha;=1) with various restrictions can be immediately achieved.</p>
Original languageAmerican English
JournalCongressus Numerantium
Volume194
StatePublished - Jan 1 2009

Disciplines

  • Education
  • Mathematics

Keywords

  • Randic Index
  • Extremal Cacti

Fingerprint

Dive into the research topics of 'On the Randić Index and Extremal Cacti'. Together they form a unique fingerprint.

Cite this