标题:The Lower Bound of Revised Szeged Index with Respect to Tricyclic Graphs
作者:Ji, Shengjin; Hong, Yanmei; Liu, Mengmeng; Wang, Jianfeng
作者机构:[Ji, Shengjin; Wang, Jianfeng] Shandong Univ Technol, Sch Sci, Zibo 255049, Shandong, Peoples R China.; [Hong, Yanmei] Fuzhou Univ, Coll Math & Comp 更多
通讯作者:Liu, MM
通讯作者地址:[Liu, MM]Lanzhou Jiaotong Univ, Sch Math, Lanzhou 730070, Gansu, Peoples R China.
来源:MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY
出版年:2018
卷:79
期:3
页码:757-778
摘要:The revised Szeged index of a graph is defined as Sz* (G) =Sigma(e=uv is an element of E)(n(u)(e) + n(0)(e)/2 (n(v)(e) + n(0)(e)/2) where n(u)(e) and n(v)(e) are, respectively, the number of vertices of G lying closer to vertex u than to vertex v and the number of vertices of G lying closer to vertex v than to vertex u, and n(0)(e) is the number of vertices equidistant to u and v. In the paper, we acquired the lower bound of revised Szeged index among all tricyclic graphs, and the extremal graphs that attain the lower bound are determined.
收录类别:SCOPUS;SCIE
资源类型:期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-85043530266&partnerID=40&md5=97764ae88c713f4c71114ebbb783664f
TOP