Extremal polyomino chains with respect to general Randić index

Mingqiang An*, Liming Xiong

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

11 Citations (Scopus)

Abstract

For a (molecular) graph G, the general Randić index Rα(G) is defined as the sum of the weights [dudv]α of all edges uv of G, where du (or dv) denotes the degree of a vertex u (or v) in G and α is an arbitrary real number. In this paper, we give an efficient formula for computing the general Randić index of polyomino chains and characterize the extremal polyomino chains with respect to this index, which generalizes one of the main results in (Yarahmadi et al. Appl Math Lett 25:166–171, 2012).

Original languageEnglish
Pages (from-to)635-647
Number of pages13
JournalJournal of Combinatorial Optimization
Volume31
Issue number2
DOIs
Publication statusPublished - 1 Feb 2016

Keywords

  • Degree
  • Extremal graphs
  • General Randić index
  • Polyomino chain

Fingerprint

Dive into the research topics of 'Extremal polyomino chains with respect to general Randić index'. Together they form a unique fingerprint.

Cite this