| 仙人掌链图的Hosoya多项式 |
| |
| 引用本文： | 刘春奇,彭建,袁星. 仙人掌链图的Hosoya多项式[J]. 新疆师范大学学报(自然科学版), 2012, 31(1): 72-74 |
| |
| 作者姓名： | 刘春奇 彭建 袁星 |
| |
| 作者单位： | 1. 新疆农业大学数理学院,新疆乌鲁木齐,830052
2. 乌鲁木齐市二十中,新疆乌鲁木齐,830052 |
| |
| 摘 要： | 1988年,对于连通图G,日本化学家Hosoya提出了一个基于距离的多项式,即H(G)≡H(G,x):=∑k≥0d(G,k)xk。仙人掌链图是一个具有如下性质的连通可平面图:其所有的内部面都是六边形;任意两个六边形要么无公共顶点,要么恰有一个公共顶点(邻接);任意三个六边形都没有公共顶点;任意一个六边形最多同时与两个六边形邻接。文章给出了仙人掌链图的Hosoya多项式。
|
| 关 键 词： | 仙人掌链图 Hosoya多项式 六边形 |
Hosoya Polynomials of Cactus Chain Graphs |
| |
| LIU Chun-qi,PENG Jian,YUAN Xing. Hosoya Polynomials of Cactus Chain Graphs[J]. Journal of Xinjiang Normal University(Natural Sciences Edition), 2012, 31(1): 72-74 |
| |
| Authors: | LIU Chun-qi PENG Jian YUAN Xing |
| |
| Affiliation: | 1(1.College of Mathematics and Physics,Xinjiang Agricultural University,Urumqi,Xinjiang,830052,China; 2.No.20 Middle School,Urumqi Xinjiang,830000,China) |
| |
| Abstract: | In 1988,for a connected graph G,Japanese chemist Hosoya proposed a distance depending polynomial,that is H(G)≡H(G,x):=∑k≥0d(G,k)xk.Cactus chain graph is a connected plane graph,of which all inner planes are hexagons,and any two hexagons have either no common vertices or exactly one common vertex(called adjacent),any three hexagons have no common vertices,and a hexagon is adjacent with at most two hexagons.In this paper,we give the expression of Hosoya polynomial of cactus chain graph. |
| |
| Keywords: | Cactus Chain Graph Hosoya Polynomial Hexagons |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
