多边形链的Merrifield-Simmons指标的极值（英文）

陈香莲; 白娅丽; 苏贵福

doi:10.13568/j.cnki.651094.2017.03.007

您当前的位置：

首页 >

文章列表页 >

多边形链的Merrifield-Simmons指标的极值（英文）

数理科学 | 更新时间：2026-01-21

- 多边形链的Merrifield-Simmons指标的极值（英文）
- 多边形链的Merrifield-Simmons指标的极值（英文）
- 新疆大学学报（自然科学版中英文） 2017年34卷第3期页码：294-298
- 作者机构：
  
  1. 昌吉学院数学系
  2. 新疆大学数学与系统科学学院
  3. 北京化工大学理学院
- 作者简介：
- 基金信息：
  
  supported by the Natural Science Foundation of Xinjiang Province(201442137-3)
- DOI：10.13568/j.cnki.651094.2017.03.007
  中图分类号： O157.5
- 纸质出版：2017
- 稿件说明：
移动端阅览
[1]陈香莲,白娅丽,苏贵福.多边形链的Merrifield-Simmons指标的极值（英文）[J],2017,34(03):294-298.
[1]陈香莲,白娅丽,苏贵福.多边形链的Merrifield-Simmons指标的极值（英文）[J],2017,34(03):294-298. DOI： 10.13568/j.cnki.651094.2017.03.007.

DOI：10.13568/j.cnki.651094.2017.03.007.

摘要

多边形链P(i1

···

it)是由t个不同的多边形Pi1

Pi2

···

Pit构成的简单图

其中任意两个多边形Pik和Pij经一条键相连当且仅当对任意的1≤k 关键词：多边形链; Merrifield-Simmons指标; 极值图; Abstract： The polygonal chain

denoted by P(i1

· · ·

it)

is a simple graph consisting of t polygons Pi1

Pi2

· · ·

Pit

in which two polygons Pikand Pijare linked by a single bond if and only if j = k+1 for 1 ≤ k < j ≤ t

and every single bond belongs to at most two polygonal chains. In this paper

we mainly investigate the extremal Merrifield-Simmons of the polygonal chains. The corresponding extremal graphs are also characterized completely. KeyWords： polygonal chains; merrifield-simmons index; extremal graphs;

Abstract

The polygonal chain

denoted by P(i1

· · ·

it)

is a simple graph consisting of t polygons Pi1

Pi2

· · ·

Pit

in which two polygons Pikand Pijare linked by a single bond if and only if j = k+1 for 1 ≤ k < j ≤ t

and every single bond belongs to at most two polygonal chains. In this paper

we mainly investigate the extremal Merrifield-Simmons of the polygonal chains. The corresponding extremal graphs are also characterized completely.

关键词

Keywords

references

Prodinger H,Tichy R F.Fibonacci numbers of graphs[J].Fibonacci Quart,1982,20:16-21.

Bai Y,Zhao B,Zhao P.Extremal Merrifield-Simmons index and Hosoya index of polyphenyl chains[J].MATCH Commun Math Comput Chem,2009,62(3):649-656.

Chen X,Zhao B,Zhao P.Six-membered ring Spiro chains with extremal Merrifield-Simmons index and Hosoya index[J].MATCH Commun Math Comput Chem,2009,62(3):657-665.

Gutman I.Extremal hexagonal chains[J].J Math Chem,1993,12:197-210.

Hua H,Zhang S.Graphs with given number of cut vertices and extremal Merrifield-Simmons index[J].Discrete Appl Math,2011,159(10):971-980.

Wei J,Li S.The number of independent sets in bicyclic graphs[J].Ars Combin,2013(CVII):465-479.

Li X,Zhao H.On the Fibonacci numbers of trees[J].Fibonacci Quarter,2006,44:32-38.

Lv X,Yu A.The Merrifield-Simmons indices and Hosoya indices of trees with a given maximum degree[J].MATCH Commun Math Comput Chem,2006,56:605-616.

Merrifield R E,Simmons H E.Topological Methods in Chemistry[M].New York:John Wiley Son,1989.

Andriantiana E O D.Energy,Hosoya index and Merrifield-Simmons index of trees with prescribed degree sequence[J].Discrete Appl Math,2013,161(6):724-741.

Pedersen A S,Vestergaard P D.The number of independent sets in unicyclic graphs[J].Discrete Appl Math,2005,152:246-256.

Wang M.Cacti with the maximum Merrifield-Simmons index and given number of cut edges[J].Appl Math Lett,2010,23(12):1416-1420.

Xu K,Li J,Zhong L.The Hosoya indices and Merrifield-Simmons indices of graphs with connectivity at most k[J].Appl Math Lett,2012,25(3):476-480.

Xu K.On the Hosoya index and the Merrifield-Simmons index of graphs with a given clique number[J].Appl Math Lett,2010,23(4):395-398.

Yu A,Lv X.The Merrifield-Simmons indices and Hosoya indices of trees with k pendent vertices[J].J Math Chem,2007,41:33-43.

Yu A,Tian F.A kind of graphs with minimal Hosoya indices and maximal Merrifield-Simmons indices[J].MATCH Commun Math Comput Chem,2006,55:103-118.

Zhang L,Tian F.Extremal catacondensed benzenoids[J].J Math Chem,2003,34:111-122.

浏览量

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

关于临界h棱连通图的最大棱数及最大图的结构(Ⅱ)——临界h棱连通图的性质和最大临界3棱连通图类的刻划