The weighted vertex PI index of (n,m)-graphs with given diameter

Gang Ma, Qiuju Bian and Jianfeng Wang

Applied Mathematics and Computation, 2019, vol. 354, issue C, 329-337

Abstract: The weighted vertex PI index of a graph G is defined byPIw(G)=∑e=uv∈E(G)(dG(u)+dG(v))(nu(e|G)+nv(e|G))where nu(e|G) denotes the number of vertices in G whose distance to the vertex u is smaller than the distance to the vertex v. In this paper, we give the upper bound and the corresponding extremal graphs on the weighted vertex PI index of (n, m)-graphs with diameter d. The lower bound and the corresponding extremal graphs on the first Zagreb index and the weighted vertex PI index of trees with diameter d are given by two procedures. The extremal graphs, given by the two procedures, are also the extremal graphs which attain the lower bound on the first Zagreb index among all connected graphs with n vertices and diameter d.

Keywords: Weighted vertex PI index; (n, m)-graphs; Tree; Diameter (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300319301481
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:354:y:2019:i:c:p:329-337

DOI: 10.1016/j.amc.2019.02.044

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().