HAMILTON

作品数：578被引量：918H指数：13
导出分析报告
相关领域：理学医药卫生更多>>
相关作者：刘文德梅凤翔任文秀孙雁罗恩更多>>
相关机构：上海交通大学哈尔滨师范大学大连理工大学内蒙古大学更多>>
相关期刊：更多>>
相关基金：国家自然科学基金国家教育部博士点基金国家重点基础研究发展计划中国博士后科学基金更多>>
-
在结果中检索

检索结果分析

结果分析中...
选择条件：
  • 期刊=Chinese Quarterly Journal of Mathematicsx
共 条 记 录，以下是1-6
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
Multi-symplectic Geometry and Preissmann Scheme for GSDBM Equation
《Chinese Quarterly Journal of Mathematics》2017年第2期172-180,共9页WANG Jun-jie LI Sheng-ping 
Supported by the Differential Equation Innovation Team(CXTD003,2013XYZ19)
The multi-symplectic geometry for the GSDBM equation is presented in this paper. The multi-symplectic formulations for the GSDBM equation are presented and the local conservation laws are shown to correspond to certai...
关键词：Dodd-Bullough-Mikhailov equation multi-symplectic theory Hamilton space Preissmann scheme local conservation laws 
Ordered and Ordered Hamilton Digraphs被引量：1
《Chinese Quarterly Journal of Mathematics》2010年第3期317-326,共10页WANGMU Jiang-shan YUAN Jun LIN Shang-wei WANG Shi-ying 
Foundation item： Supported by the National Natural Science Foundation of China（61070229）; Supported by the Natural Science Foundation of Shanxi Province（2008011010）
A digraph D is k-ordered if for every sequence S：v 1,v 2,…,v k of k distinct vertices,there exists a cycle C such that C encounters the vertices of S in the specified order.In particular,we say that D is k-ordered h...
关键词：DIGRAPHS k-ordered digraphs k-ordered hamiltonian digraphs 
Note on Faudree-Schelp Theorem in Path Connected Graphs and Ore Theorem in Hamilton Connected Graphs
《Chinese Quarterly Journal of Mathematics》2003年第2期175-177,共3页ZHAOKe-wen ZENGKe-yang 
In this note more short proofs are given for Faudree-Schelp theorem and Ore theorem.
关键词：Faudree-Schelp theorem Ore theorem Hamilton connected graphs 
A Sufficient Condition of Hamilton Connected Graph
《Chinese Quarterly Journal of Mathematics》2003年第1期99-102,共4页YINZhi-xiang BAIMei 
Let G be a 3-connected graph with n vertices. The paper proves that if for each pair of vertices u and v of G, d(u,v)=2, has ｜N(u)∩N(v)｜≤α(α is the minimum independent set number), and then max{d(u),d(v)}≥n+12,...
关键词：DEGREE connected graph independent set 
Hamilton Properties of Domination Critical Graphs
《Chinese Quarterly Journal of Mathematics》1998年第1期14-21, ,共8页段广森 王新社 
Ewa·Wojcicka [1] has proved that the connected 3 γ critical graphs has a H path and has put forward to such a conjecture: Connected 3 γ critical graphs without endpoints are H graphs. In this paper,we prove that if...
关键词：critical graph H    path H    cycle H    graph 
On Hamiltonian-Connected m-Regular Graphs of Order 2m+2
《Chinese Quarterly Journal of Mathematics》1989年第2期7+1-6,共7页苏向盈 
本文完全解决了阶为2m+2的m-正则图的Hamilton连通性问题。主要结果是:任一个既不是二部图也不是具有类型T的阶为2m+2,m≥4的m-正则图都是Hamilton连通的。这里,一个图G称为是具有类T了,如果G是由添加两个不相邻的顶点和2m条边至图2K_m...
关键词：正则图 HAMILTON 二部图 连通性 SUBGRAPH vertex BIPARTITE haver 数学季刊 LEMMA 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部