全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

Wiener Polarity Index of Cycle-Block Graphs

DOI: 10.1155/2014/476705

Full-Text   Cite this paper   Add to My Lib

Abstract:

The Wiener polarity index of a graph is the number of unordered pairs of vertices of such that the distance between and 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. 1. Introduction Let be a connected simple graph. The distance between the vertices and of is defined as the length of a shortest path connecting and . is called the th neighbor set of . is called the degree of . If , then is called a pendant vertex of . denotes a cycle of order . The girth of , denoted by , is the length of the shortest cycle of . A block of the graph is a maximal 2-connected subgraph of . A cactus graph is a connected graph in which no edge lies in more than one cycle, such that each block of a cactus graph is either an edge or a cycle. If all blocks of a cactus are cycles, the graph is defined as cycle-block graph. In this paper, suppose the cycle-block graph consist of cycles, the length of the cycles may be different. If all blocks of a cactus are cycles of the same length , the cactus is -uniform. A hexagonal cactus is a -uniform cactus that every block of the graph is a hexagon. A vertex shared by two or more hexagons is called a cut-vertex. If each hexagon of a hexagonal cactus has at most two cut-vertices and each cut-vertex is shared by exactly two hexagons, we say that is a chain hexagonal cactus (see Figure 1(a)). A star cactus is a cactus consisting of cycles, spliced together in a single vertex (see Figure 1(b)). A star hexagonal cactus is a star cactus in which every cycle is a hexagon. Figure 1: A chain hexagonal cactus (a) and a star cactus graph (b). The Wiener polarity index of , denoted by , is the number of unordered vertex pairs of distance 3. It was first used in a linear formula to calculate the boiling points of paraffin [1]: where are constants for a given isomeric group. The Wiener polarity index became popular recently, and many mathematical properties and its chemical applications were discovered [2–6]. In this line, Du et al. [2] characterized the minimum and maximum Wiener polarity index among all trees of order , and Deng [3] determined the largest Wiener polarity indices among all chemical trees of order . M. H. Liu and B. L. Liu [4] determined the first two smallest Wiener polarity indices among all unicyclic graphs of order . Hou et al. [5] determined the maximum Wiener polarity

References

[1]  H. Wiener, “Structural determination of paraffin boiling points,” Journal of the American Chemical Society, vol. 69, no. 1, pp. 17–20, 1947.
[2]  W. Du, X. Li, and Y. Shi, “Algorithms and extremal problem on Wiener polarity index,” MATCH: Communications in Mathematical and in Computer Chemistry, vol. 62, no. 1, pp. 235–244, 2009.
[3]  H. Deng, “On the extremal Wiener polarity index of chemical trees,” MATCH: Communications in Mathematical and in Computer Chemistry, vol. 66, no. 1, pp. 305–314, 2011.
[4]  M. H. Liu and B. L. Liu, “On the Wiener polarity index,” MATCH: Communications in Mathematical and in Computer Chemistry, vol. 66, no. 1, pp. 293–304, 2011.
[5]  H. Q. Hou, B. L. Liu, and Y. F. Huang, “The maximum Wiener polarity index of unicyclic graphs,” Applied Mathematics and Computation, vol. 218, pp. 10149–10157, 2012.
[6]  A. Behmarama, H. Yousefi-Azaria, and A. R. Ashafi, “Wiener polarity index of fullerenes and hexagonal systems,” Applied Mathematics Letters, vol. 25, no. 10, pp. 1510–1513, 2012.
[7]  T. Do?li? and F. M?l?y, “Chain hexagonal cacti: matchings and independent sets,” Discrete Mathematics, vol. 310, no. 12, pp. 1676–1690, 2010.
[8]  T. Do?li? and M. S. Litz, “Matchings and independent sets in polyphenylene chains,” MATCH: Communications in Mathematical and in Computer Chemistry, vol. 67, no. 2, pp. 313–330, 2012.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133