Bounds on the weighted vertex PI index of cacti graphs
Filomat, Tome 33 (2019) no. 18, p. 5977
Voir la notice de l'article provenant de la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
The weighted vertex PI index of a graph G is defined by PIw(G) = ∑ e=uv∈E(G) (dG(u) + dG(v))(nu(e|G) + nv(e|G)) where dG(u) denotes the vertex degree of u and 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. A graph is a cactus if it is connected and all its blocks are either edges or cycles. In this paper, we give the upper and lower bounds on the weighted vertex PI index of cacti with n vertices and s cycles, and completely characterize the corresponding extremal graphs
Gang Ma; Qiuju Bian; Jianfeng Wang. Bounds on the weighted vertex PI index of cacti graphs. Filomat, Tome 33 (2019) no. 18, p. 5977 . doi: 10.2298/FIL1918977M
@article{10_2298_FIL1918977M,
author = {Gang Ma and Qiuju Bian and Jianfeng Wang},
title = {Bounds on the weighted vertex {PI} index of cacti graphs},
journal = {Filomat},
pages = {5977 },
year = {2019},
volume = {33},
number = {18},
doi = {10.2298/FIL1918977M},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.2298/FIL1918977M/}
}
Cité par Sources :