On the general sum-connectivity index and general Randić index of cacti

Shehnaz Akhter, Muhammad Imran, Zahid Raza

Research output: Contribution to journalArticlepeer-review

15 Citations (Scopus)

Abstract

Let G be a connected graph. The degree of a vertex x of G, denoted by dG(x) , is the number of edges adjacent to x. The general sum-connectivity index is the sum of the weights (dG(x)+dG(y))α for all edges xy of G, where α is a real number. The general Randić index is the sum of weights of (dG(x)dG(y))α for all edges xy of G, where α is a real number. The graph G is a cactus if each block of G is either a cycle or an edge. In this paper, we find sharp lower bounds on the general sum-connectivity index and general Randić index of cacti.

Original languageEnglish
Article number300
JournalJournal of Inequalities and Applications
Volume2016
Issue number1
DOIs
Publication statusPublished - Dec 1 2016

Keywords

  • cacti
  • general Randić index
  • general sum-connectivity index

ASJC Scopus subject areas

  • Analysis
  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'On the general sum-connectivity index and general Randić index of cacti'. Together they form a unique fingerprint.

Cite this