中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Hamiltonian jump graphs

文献类型:期刊论文

作者Wu, BYDR; Meng, JX
刊名DISCRETE MATHEMATICS
出版日期2004-12-28
卷号289期号:1-3页码:95-106
关键词jump graph line graph Hamilton cycle
ISSN号0012-365X
DOI10.1016/j.disc.2004.09.003
英文摘要Let G be a nonempty graph. The jump graph J (G) of G is the graph whose vertices are edges of G, and where two vertices of J(G) are adjacent if and only if they are not adjacent in G. Equivalently, the jump graph J(G) of G is the complement of line graph L(G) of G. In this paper, we characterize hamiltonian jump graphs and settle two conjectures posed by Chartrand et al. on jump graphs. (C) 2004 Elsevier B.V. All rights reserved.
WOS研究方向Mathematics
语种英语
WOS记录号WOS:000225987300008
出版者ELSEVIER SCIENCE BV
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/19702]  
专题中国科学院数学与系统科学研究院
通讯作者Wu, BYDR
作者单位1.Xinjiang Univ, Coll Math & Syst Sci, Urumqi 830046, Xinjiang, Peoples R China
2.Chinese Acad Sci, Inst Syst Sci, Acad Math & Syst Sci, Beijing 100080, Peoples R China
推荐引用方式
GB/T 7714
Wu, BYDR,Meng, JX. Hamiltonian jump graphs[J]. DISCRETE MATHEMATICS,2004,289(1-3):95-106.
APA Wu, BYDR,&Meng, JX.(2004).Hamiltonian jump graphs.DISCRETE MATHEMATICS,289(1-3),95-106.
MLA Wu, BYDR,et al."Hamiltonian jump graphs".DISCRETE MATHEMATICS 289.1-3(2004):95-106.

入库方式: OAI收割

来源:数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。