Open AccessWiener Polarity Index of Cycle-Block Graphs
Author(s) -
Zhen Jia,
Fuyi Wei,
Yang Wu
Publication year - 2014
Publication title -
chinese journal of mathematics
Language(s) - English
Resource type - Journals
ISSN - 2314-8071
DOI - 10.1155/2014/476705
Subject(s) - algorithm , artificial intelligence , computer science
The Wiener polarity index WP of a graph G is the number of unordered pairs of vertices u,v of G such that the distance dG(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
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom