相关期刊:《Wuhan University Journal of Natural Sciences》《Science China Mathematics》《Acta Mathematica Scientia》《Applied Mathematics(A Journal of Chinese Universities)》更多>>
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...
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,...
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...
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...
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...
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...