标题:The Vertex PI and Szeged Indices of Chain Graphs (vol 68, pg 349, 2012)
作者:Luo, Zhaoyang; Wu, Jianliang
作者机构:[Luo, Zhaoyang; Wu, Jianliang] Shandong Univ, Sch Math, Jinan 250100, Peoples R China.; [Luo, Zhaoyang] Changji Univ, Dept Math, Changji 831100, Peo 更多
通讯作者:Wu, JL
通讯作者地址:[Wu, JL]Shandong Univ, Sch Math, Jinan 250100, Peoples R China.
来源:MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY
出版年:2013
卷:70
期:1
页码:467-470
摘要:Let G be a connected graph with vertex set V(G) and edge set E(G). The vertex PI index and Szeged index of G are defined as PIv(G) = Sigma(e)=uv epsilon E(G)(n(u)(e vertical bar G)+n(v)(e vertical bar G)) and Sz(G) = Sigma(e=uv epsilon E(G)) n(u)(e vertical bar G)n(u)(e vertical bar G), where n.(eIG) denotes the number of vertices of G lying closer to the vertex u than to the vertex v. Analogously, the number of vertices of G lying closer to the vertex v than to the vertex u denoted by n(v)(e vertical bar G). In this paper, using the same discussion methods in [MATCH 68 (2012) 349-356], we completely correct "the vertex PI and Szeged indices of chain graphs".
收录类别:SCOPUS;SCOPUS;SCIE
资源类型:期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-84898736317&partnerID=40&md5=2c19a8a17168cc57433f21d79b0c468e
TOP