The following pages link to Xie-Bin Chen (Q251071):
Displayed 45 items.
- The 2-path-bipanconnectivity of hypercubes (Q497128) (← links)
- Construction of optimal independent spanning trees on folded hypercubes (Q497932) (← links)
- A fast algorithm for computing the determinants of banded circulant matrices (Q530029) (← links)
- Many-to-many disjoint paths in faulty hypercubes (Q730958) (← links)
- Panconnectivity and edge-pancyclicity of multidimensional torus networks (Q741532) (← links)
- Paired many-to-many disjoint path covers of hypercubes with faulty edges (Q763493) (← links)
- Cycles passing through a prescribed path in a hypercube with faulty edges (Q765497) (← links)
- Item:Q251071 (redirect page) (← links)
- A new method for constructing infinite families of \(k\)-tight optimal double loop networks (Q862697) (← links)
- The number of spanning trees in directed circulant graphs with non-fixed jumps (Q882110) (← links)
- Paired 2-disjoint path covers of multidimensional torus networks with faulty edges (Q894448) (← links)
- Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes (Q897923) (← links)
- A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges (Q963441) (← links)
- Some results on topological properties of folded hypercubes (Q976130) (← links)
- On path bipancyclicity of hypercubes (Q987833) (← links)
- Hamiltonian paths and cycles passing through a prescribed path in hypercubes (Q990111) (← links)
- Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs (Q991753) (← links)
- Study on the values of broadcast function \(B(2^ k-2)\) and \(B(2^ k- 1)\) (Q1200054) (← links)
- Some families of chromatically unique bipartite graphs (Q1584227) (← links)
- Edge-fault-tolerant diameter and bipanconnectivity of hypercubes (Q1675872) (← links)
- The number of spanning trees in odd valent circulant graphs (Q1827730) (← links)
- Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs (Q1944080) (← links)
- Matchings extend to Hamiltonian cycles in hypercubes with faulty edges (Q2175471) (← links)
- Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges (Q2258909) (← links)
- Cycles passing through prescribed edges in a hypercube with some faulty edges (Q2380025) (← links)
- Paired many-to-many disjoint path covers of the hypercubes (Q2446439) (← links)
- Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph (Q2446463) (← links)
- The construction of infinite families of any \(k\)-tight optimal and singular \(k\)-tight optimal directed double loop networks (Q2461503) (← links)
- (Q2743083) (← links)
- (Q2743098) (← links)
- (Q2743116) (← links)
- (Q2749138) (← links)
- (Q3447600) (← links)
- (Q3513425) (← links)
- (Q4232254) (← links)
- (Q4489800) (← links)
- (Q4531480) (← links)
- (Q4707565) (← links)
- (Q5292833) (← links)
- (Q5489994) (← links)
- (Q5490074) (← links)
- (Q5717354) (← links)
- (Q5717363) (← links)
- A new method for constructing minimal broadcast networks (Q5905613) (← links)
- Hamiltonicity of hypercubes with faulty vertices (Q5964820) (← links)
