http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
CERTAIN GENERALIZED THORN GRAPHS AND THEIR WIENER INDICES
Kathiresan, KM.,Parameswaran, C. The Korean Society for Computational and Applied M 2012 Journal of applied mathematics & informatics Vol.30 No.5
If G is any connected graph of order p; then the thorn graph $G_p^*$ with code ($n_1$, $n_2$, ${\cdots}$, $n_p$) is obtained by adding $n_i$ pendent vertices to each $i^{th}$ vertex of G. By treating the pendent edge of a thorn graph as $P_2$, $K_2$, $K_{1,1}$, $K_1{\circ}K_1$ or $P_1{\circ}K_1$, we generalize a thorn graph by replacing $P_2$ by $P_m$, $K_2$ by $K_m$, $K_{1,1}$ by $K_{m,n}$, $K_1{\circ}K_1$ by $K_m{\circ}K_1$ and $P_1{\circ}K_1$ by $P_m{\circ}K_1$ and their respective generalized thorn graphs are denoted by $G_P$, $G_K$, $G_B$, $G_{KK}$ and $G_{PK}$ respectively. Many chemical compounds can be treated as $G_P$, $G_K$, $G_B$, $G_{KK}$ and $G_{PK}$ of some graphs in graph theory. In this paper, we obtain the bounds of the wiener index for these generalization of thorn graphs.
CERTAIN GENERALIZED THORN GRAPHS AND THEIR WIENER INDICES
KM. Kathiresan,C. Parameswaran 한국전산응용수학회 2012 Journal of applied mathematics & informatics Vol.30 No.5
If G is any connected graph of order p; then the thorn graph G∗p with code (n1, n2, ... , np) is obtained by adding ni pendent vertices to each ith vertex of G: By treating the pendent edge of a thorn graph as P2, K2, K1, 1, K1 ◦K1 or P1 ◦K1, we generalize a thorn graph by replacing P2 by Pm, K2 by Km, K1, 1 by Km, n, K1 ◦ K1 by Km ◦ K1 and P1 ◦ K1by Pm ◦ K1 and their respective generalized thorn graphs are denoted by GP ;GK;GB;GKK and GPK respectively. Many chemical compounds can be treated as GP, GK, GB, GKK and GPK of some graphs in graph theory. In this paper, we obtain the bounds of the wiener index for these generalization of thorn graphs.