Extremal polyomino chains with respect to general Randić index

Mingqiang An; Liming Xiong

doi:10.1007/s10878-014-9781-6

Extremal polyomino chains with respect to general Randić index

Mingqiang An^*, Liming Xiong

^*此作品的通讯作者

数学学院

Tianjin University of Science & Technology

科研成果: 期刊稿件 › 文章 › 同行评审

11 引用（Scopus）

摘要

For a (molecular) graph G, the general Randić index R_α(G) is defined as the sum of the weights [d_ud_v]^α of all edges uv of G, where d_u (or d_v) 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).

源语言	英语
页（从-至）	635-647
页数	13
期刊	Journal of Combinatorial Optimization
卷	31
期	2
DOI	https://doi.org/10.1007/s10878-014-9781-6
出版状态	已出版 - 1 2月 2016

访问文件

10.1007/s10878-014-9781-6

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{eafb2b05cfc34b0eb31ed56913293d2e,

title = "Extremal polyomino chains with respect to general Randi{\'c} index",

abstract = "For a (molecular) graph G, the general Randi{\'c} 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{\'c} 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).",

keywords = "Degree, Extremal graphs, General Randi{\'c} index, Polyomino chain",

author = "Mingqiang An and Liming Xiong",

note = "Publisher Copyright: {\textcopyright} 2014, Springer Science+Business Media New York.",

year = "2016",

month = feb,

day = "1",

doi = "10.1007/s10878-014-9781-6",

language = "English",

volume = "31",

pages = "635--647",

journal = "Journal of Combinatorial Optimization",

issn = "1382-6905",

publisher = "Springer Netherlands",

number = "2",

}

TY - JOUR

T1 - Extremal polyomino chains with respect to general Randić index

AU - An, Mingqiang

AU - Xiong, Liming

PY - 2016/2/1

Y1 - 2016/2/1

N2 - 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).

AB - 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).

KW - Degree

KW - Extremal graphs

KW - General Randić index

KW - Polyomino chain

UR - http://www.scopus.com/inward/record.url?scp=84955631205&partnerID=8YFLogxK

U2 - 10.1007/s10878-014-9781-6

DO - 10.1007/s10878-014-9781-6

M3 - Article

AN - SCOPUS:84955631205

SN - 1382-6905

VL - 31

SP - 635

EP - 647

JO - Journal of Combinatorial Optimization

JF - Journal of Combinatorial Optimization

IS - 2

ER -

Extremal polyomino chains with respect to general Randić index

摘要

访问文件

其它文件与链接

指纹

引用此