| Publication | Date of Publication | Type |
|---|
Matchings extend to Hamiltonian cycles in hypercubes with faulty edges
Frontiers of Mathematics in China | 2020-04-29 | Paper |
Edge-fault-tolerant diameter and bipanconnectivity of hypercubes
Information Processing Letters | 2017-11-03 | Paper |
A fast algorithm for computing the determinants of banded circulant matrices
Applied Mathematics and Computation | 2017-06-09 | Paper |
Hamiltonicity of hypercubes with faulty vertices
Information Processing Letters | 2016-03-01 | Paper |
Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes
Theoretical Computer Science | 2015-12-08 | Paper |
Paired 2-disjoint path covers of multidimensional torus networks with faulty edges
Information Processing Letters | 2015-12-01 | Paper |
Fault-free cycles passing through prescribed a linear forest in a hypercube with faulty edges.
| 2015-10-27 | Paper |
Construction of optimal independent spanning trees on folded hypercubes
Information Sciences | 2015-09-25 | Paper |
The 2-path-bipanconnectivity of hypercubes
Information Sciences | 2015-09-23 | Paper |
Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges
Frontiers of Mathematics in China | 2015-02-27 | Paper |
Panconnectivity and edge-pancyclicity of multidimensional torus networks
Discrete Applied Mathematics | 2014-09-12 | Paper |
Paired many-to-many disjoint path covers of the hypercubes
Information Sciences | 2014-04-16 | Paper |
Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph
Information Sciences | 2014-04-16 | Paper |
Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs
Information Processing Letters | 2013-04-04 | Paper |
Cycles passing through a prescribed path in a hypercube with faulty edges
Information Processing Letters | 2012-03-19 | Paper |
Paired many-to-many disjoint path covers of hypercubes with faulty edges
Information Processing Letters | 2012-03-09 | Paper |
Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs
Information Processing Letters | 2010-09-07 | Paper |
Hamiltonian paths and cycles passing through a prescribed path in hypercubes
Information Processing Letters | 2010-09-02 | Paper |
On path bipancyclicity of hypercubes
Information Processing Letters | 2010-08-16 | Paper |
Some results on topological properties of folded hypercubes
Information Processing Letters | 2010-06-16 | Paper |
A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
Information Processing Letters | 2010-04-19 | Paper |
Cycles passing through prescribed edges in a hypercube with some faulty edges
Information Processing Letters | 2010-03-24 | Paper |
Many-to-many disjoint paths in faulty hypercubes
Information Sciences | 2009-10-01 | Paper |
Infinite families of singular \(k\)-tight integers
| 2008-08-06 | Paper |
The construction of infinite families of any \(k\)-tight optimal and singular \(k\)-tight optimal directed double loop networks
Science in China. Series A | 2007-11-28 | Paper |
Infinite families of singular \(k\)-tight integers
| 2007-06-25 | Paper |
The number of spanning trees in directed circulant graphs with non-fixed jumps
Discrete Mathematics | 2007-05-23 | Paper |
A new method for constructing infinite families of \(k\)-tight optimal double loop networks
Science in China. Series A | 2007-01-24 | Paper |
The number of spanning trees in directed circulant graphs
| 2006-10-04 | Paper |
The number of spanning trees in the undirected circulant graphs with non-fixed jumps
| 2006-10-04 | Paper |
scientific article; zbMATH DE number 2246351 (Why is no real title available?)
| 2006-01-13 | Paper |
scientific article; zbMATH DE number 2246359 (Why is no real title available?)
| 2006-01-13 | Paper |
The number of spanning trees in odd valent circulant graphs
Discrete Mathematics | 2004-08-06 | Paper |
scientific article; zbMATH DE number 1926055 (Why is no real title available?)
| 2004-02-10 | Paper |
Asymptotic enumeration theorem for the number of spanning trees in grids and tori
Journal of Zhangzhou Teachers College. Natural Science | 2002-08-01 | Paper |
scientific article; zbMATH DE number 1747598 (Why is no real title available?)
| 2002-05-29 | Paper |
The numbers of spanning trees in undirected circulant graphs
Journal of Zhangzhou Teachers College. Natural Science | 2001-09-24 | Paper |
The structure of optimal edge fault tolerant graphs of star networks
Journal of Zhangzhou Teachers College. Natural Science | 2001-09-24 | Paper |
The numbers of spanning trees of some families of circulant graphs
Journal of Zhangzhou Teachers College. Natural Science | 2001-09-24 | Paper |
scientific article; zbMATH DE number 1475185 (Why is no real title available?)
| 2000-11-19 | Paper |
Some families of chromatically unique bipartite graphs
Discrete Mathematics | 2000-11-02 | Paper |
scientific article; zbMATH DE number 1262192 (Why is no real title available?)
| 1999-03-15 | Paper |
A new method for constructing minimal broadcast networks
Chinese Science Bulletin | 1993-02-18 | Paper |
Study on the values of broadcast function \(B(2^ k-2)\) and \(B(2^ k- 1)\)
Chinese Science Bulletin | 1993-01-17 | Paper |
