国家自然科学基金(11171129)

作品数:6被引量:8H指数:2
导出分析报告
相关期刊:《Wuhan University Journal of Natural Sciences》《Science China Mathematics》《Acta Mathematica Scientia》《Applied Mathematics(A Journal of Chinese Universities)》更多>>
相关主题:HAMILTONIANENHANCEDEMBEDDINGCLOSUREING更多>>
相关领域:理学自动化与计算机技术更多>>
-

检索结果分析

结果分析中...
条 记 录,以下是1-6
视图:
排序:
Saturation Number for Linear Forest 2P3∪tP2
《Wuhan University Journal of Natural Sciences》2019年第4期283-289,共7页LIU Min HU Zhiquan 
Supported by the National Natural Science Foundation of China(11071096,11171129);the Natural Science Foundation of Hubei Province(2016CFB146);Research Foundation of College of Economics,Northwest University of Political Science and Law(19XYKY07)
For a fixed graph F,a graph G is F-saturated if it has no F as a subgraph,but does contain F after the addition of any new edge.The saturation number,sat(n,F),is the minimum number of edges of a graph in the set of al...
关键词:SATURATION NUMBER saturated GRAPH LINEAR FOREST 
Even factors with a bounded number of components in iterated line graphs
《Science China Mathematics》2017年第1期177-188,共12页LV ShengMei XIONG LiMing 
supported by National Natural Science Foundation of China (Grant Nos. 11471037 and 11171129);Specialized Research Fund for the Doctoral Program of Higher Education (Grant No. 20131101110048)
We consider even factors with a bounded number of components in the n-times iterated line graphs L^n(G). We present a characterization of a simple graph G such that L^n(G) has an even factor with at most k components,...
关键词:even factor iterated line graph branch closure claw-free graph 
VERTEX-FAULT-TOLERANT CYCLES EMBEDDING ON ENHANCED HYPERCUBE NETWORKS被引量:1
《Acta Mathematica Scientia》2013年第6期1579-1588,共10页张艳娟 刘红美 刘敏 
supported by NSFC(11071096 and 11171129);Hubei Province,China(T201103)
In this paper, we study the enhanced hypercube, an attractive variant of the hypercube and obtained by adding some complementary edges from a hypercube, and focus on cycles embedding on the enhanced hypercube with fau...
关键词:enhanced hypercube fault tolerance cycles embedding 
PATHS AND CYCLES EMBEDDING ON FAULTY ENHANCED HYPERCUBE NETWORKS被引量:6
《Acta Mathematica Scientia》2013年第1期227-246,共20页刘敏 刘红美 
supported by NSFC (11071096, 11171129);NSF of Hubei Province, China (T201103)
Let Qn,k (n 〉 3, 1 〈 k ≤ n - 1) be an n-dimensional enhanced hypercube which is an attractive variant of the hypercube and can be obtained by adding some complementary edges, fv and fe be the numbers of faulty ve...
关键词:enhanced hypercube fault-tolerant embedding paths embedding cycles em-bedding Hamiltonian-laceability 
Some Structural Properties of 2-Walk (a, b)-Linear Graphs
《Wuhan University Journal of Natural Sciences》2012年第5期457-460,共4页FAN Qiong QI Huan 
Supported by the National Natural Science Foundation of China(11171129)
A graph has exactly two main eigenvalues if and only if it is a 2-walk linear graph. In this paper, we show some structural properties that a 2-walk (a, b)-linear graph holds. According to these properties, we can e...
关键词:main eigenvalues 2-walk linear graph PATH CYCLE 
On hamiltonicity of 2-connected claw-free graphs被引量:2
《Applied Mathematics(A Journal of Chinese Universities)》2012年第2期234-242,共9页TIAN Run-li XIONG Li-ming 
Supported by the National Natural Science Foundation of China(11071016 and 11171129);the Beijing Natural Science Foundation(1102015)
A graph G has the hourglass property if every induced hourglass S(a tree with a degree sequence 22224) contains two non-adjacent vertices which have a common neighbor in G-V(S).For an integer k≥4,a graph G has th...
关键词:claw-free graph HAMILTONIAN CLOSURE the hourglass property the single k-cycle property. 
检索报告 对象比较 聚类工具 使用帮助 返回顶部