Wiener polarity index of cycle-block graphs
Summary: The Wiener polarity index \(W_p\) of a graph \(G\) is the number of unordered pairs of vertices \(u, v\) of \(G\) such that the distance \(d_G (u,v)\) between \(u\) and \(v\) is 3. Cycle-block graph is a connected graph in which every block is a cycle. In this paper, we determine the maximum and minimum Wiener polarity index of cycle-block graphs and describe their extremal graphs; the extremal graphs of 4-uniform cactus with respect to Wiener polarity index are also discussed.
scientific article; zbMATH DE number 6356650