位置：成果数据库 > 期刊 > 期刊详情页
关于哈密尔顿指数的综述
  • ISSN号：1000-5862
  • 期刊名称：《江西师范大学学报：自然科学版》
  • 时间：0
  • 分类：O157.6[理学—数学;理学—基础数学]
  • 作者机构：[1]北京理工大学数学与统计学院,北京100081
  • 相关基金：国家自然科学基金（11071016;11171129）和教育部博士点基金（20131101110048）资助项目.
作者： 熊黎明[1], 朱倩倩[1]
关键词： 迭代线图, 哈密尔顿指数, 类哈密尔顿指数, iterated line graph, hamiltonian index, hamiltonian-like index
中文摘要：

图G的线图L（ G）是指以G的边集E（ G）为顶点集且L（ G）的2个顶点邻接当且仅当它们在G中有公共顶点。 n次迭代线图Ln（G）递归地定义为L0（G）=G，Ln（G）=L（Ln-1（G））（n∈N=｛0，1，2，…｝），其中L1（ G）=L（ G）并且假设Ln-1（ G）非空，使得Ln（ G）是哈密尔顿的最小整数n称为哈密尔顿指数，用h（ G）表示。该文综述了（类）哈密尔顿指数的一些结果。

英文摘要：

Let G be a simple graph. The line graph L（ G）of a graph G is a graph which has E（ G）as its vertex set and two vertices are adjacent in L（ G）if and only if they share an end vertex in G. The n-th iterated line graph Ln（G）is defined recursively by L0（G）=G,Ln（G）=L（Ln-1（G））（n∈N={0,1,2,…}）,where L1（G）=L（G） and Ln-1（ G）is assumed to be nonempty. The hamiltonian index of a graph G,denoted by h（ G）,is the smallest in-teger n such that Ln（G）is hamiltonian. The results of hamiltonian（like）indices of graphs have been summariczed.

同期刊论文项目
群连通度和子图存在性及相关问题的研究
期刊论文 42
图中因子存在性的新内容与新方法研究
期刊论文 34
同项目期刊论文
Spanning subgraph with Eulerian components
The Nordhaus–Gaddum-type inequalities for the Zagreb index and co-index of graphs
The Chvátal-Erdös condition for supereulerian graphs and the Hamiltonian index
关于图的反符号圈控制数
Hamiltonian index is NP-complete
闭无爪图在圈闭包运算下哈密尔顿指数的稳定性
Star subdivisions and connected even factors in the square of a graph
On 2-factors in claw-free graphs whose edges are in small cycles
On hamiltonicity of 2-connected claw-free graphs
Hamiltonicity of 3-connected line graphs
HARARY INDEX OF THE k-TH POWER OF A GRAPH
关于极值k超欧拉图
Maximally edge-connected graphs and Zeroth-order general Randi? index for
On the Co-PI and Laplacian Co-PI eigenvalues of a graph
Nordhaus–Gaddum-type inequality for the hyper-Wiener index of graphs when decomposing into three par
哈密尔顿指数是NP-完全的
线图中有界定分支的2-因子
Supereulerianity of k-edge-connected graphs with a restriction on small bonds
Smallest 2-edge-connected graphs without a spanning trail
Even factor of a graph with a bounded number of components
On the maximum and minimum first redormulated Zagreb of graphs with connectivity at most k
Closure operation for even factors on claw-free graphs
Closure concept for 2-factors in claw-free graphs
Every 3-Connected Claw-Free Z8-Free Graph Is Hamiltonian
2-factors with the bounded number of components in line graphs
Spanning eulerian subgraphs in N2-locally connected claw-free graphs
Supereulerian index is stable under contractions and closures
（a,b,Ck）-临界图的一个最小度条件
Nowhere-zero 3-flows and $Z_3$-connectivity in bipartite graphs
Group connectivity in 3-edge-connected graphs
Degree condition and $Z_3$-connectivity
The L(2,1)-labelling problem for cubic Cayley graphs on dihedral groups
Group Connectivity of Bridged Graphs
Labeling outerplanar graphs with maximum degree three
A relaxation of the Bordeaux Conjecture
Maximum Degree Condition and Group Connectivity
Group connectivity of semistrong product of graphs
Degree sum of 3 independent vertices and Z(3)-connectivity
Spanning Eulerian Subgraphs of 2-Edge-Connected Graphs
Induced hourglass and the equivalence between hamiltonicity and supereulerianity in claw-free graphs
Hamiltonian claw-free graphs with locally disconnected vertices
Realizing degree sequences as Z(3)-connected graphs
Nowhere-zero 3-flows of claw-free graphs
A note on Z(5)-connectivity in 3-edge-connected graphs
The Chvatal-Erdos Condition for Group Connectivity in Graphs
Nowhere-zero 3-flows in semistrong product of graphs
Z(3)-Connectivity of Wreath Product of Graphs
Collapsible graphs and Hamilton cycles of line graphs
Z3-connectivity with independent number 2
Nowhere-zero 3-flows in graphs admitting solvable arc-transitive groups of automorphisms
Strong chromatic index of subcubic planar multigraphs
Nowhere-zero 3-flows in Cayley graphs on generalized dihedral group and generalized quaternion group
Nowhere-zero 3-flows and $Z_3$-connectivity
Group chromatic number of Halin graphs
Z3-connectivity of K(1, 3)-free graphs without induced cycle of length at least 5
Group connectivity and matchings
Planar graphs without 5-cycles and intersecting triangles are (1, 1, 0)-colorable
On hamiltonicity of 2-connected claw-free graphs
故障折叠超立方体中的路和圈(英文)
（a,b,Ck）-临界图的一个最小度条件
含故障点的加强超立方体中路和圈的嵌入
故障加强超立方体中的路和圈
加强超立方体中条件容错圈
期刊信息
  • 《江西师范大学学报：自然科学版》
  • 北大核心期刊（2011版）
  • 主管单位:江西师范大学
  • 主办单位:江西师范大学
  • 主编：
  • 地址：南昌市紫阳大道99号
  • 邮编：330022
  • 邮箱：lk8506184@126.com
  • 电话：0791-88506814
  • 国际标准刊号：ISSN：1000-5862
  • 国内统一刊号：ISSN：36-1092/N
  • 邮发代号:44-56
  • 获奖情况:
  • 2009年中国高等学校自然科学学报研究会颁发“全国...,2009年被评为：第四届华东地区优秀期刊奖”,2008年教育部科技司授予“第2届中国高校优秀科技...,2008年江西省新闻出版局授予“第3届江西省优秀期...,2004年教育部科技司授予“全国高校优秀科技期刊二...
  • 国内外数据库收录:
  • 俄罗斯文摘杂志,美国化学文摘（网络版）,美国数学评论（网络版）,波兰哥白尼索引,德国数学文摘,美国剑桥科学文摘,中国中国科技核心期刊,中国北大核心期刊（2004版）,中国北大核心期刊（2008版）,中国北大核心期刊（2011版）,中国北大核心期刊（2014版）
  • 被引量:5205