Wiener polarity index of cycle-block graphs (Q463226)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Wiener polarity index of cycle-block graphs |
scientific article; zbMATH DE number 6356650
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Wiener polarity index of cycle-block graphs |
scientific article; zbMATH DE number 6356650 |
Statements
Wiener polarity index of cycle-block graphs (English)
0 references
16 October 2014
0 references
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.
0 references
extremal graphs
0 references
4-uniform cactus
0 references
