The following pages link to Cheng-Kuan Lin (Q260050):
Displayed 50 items.
- The restricted \(h\)-connectivity of the data center network DCell (Q260051) (← links)
- Structure connectivity and substructure connectivity of hypercubes (Q284586) (← links)
- Solution to an open problem on 4-ordered Hamiltonian graphs (Q442328) (← links)
- The \(g\)-good-neighbor conditional diagnosability of hypercube under PMC model (Q450261) (← links)
- The super connectivity of the pancake graphs and the super laceability of the star graphs (Q557901) (← links)
- Mutually independent Hamiltonian connectivity of \((n,k)\)-star graphs (Q659782) (← links)
- Fault-tolerant Hamiltonian connectivity of the WK-recursive networks (Q726341) (← links)
- A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges (Q732323) (← links)
- Combinatorial analysis of the subsystem reliability of the split-star network (Q778418) (← links)
- Structure connectivity and substructure connectivity of \(k\)-ary \(n\)-cube networks (Q781946) (← links)
- The super laceability of the hypercubes (Q834885) (← links)
- On the spanning connectivity of graphs (Q864172) (← links)
- An efficient algorithm to construct disjoint path covers of DCell networks (Q897875) (← links)
- The bipanpositionable bipancyclic property of the hypercube (Q979832) (← links)
- On the spanning connectivity and spanning laceability of hypercube-like networks (Q995576) (← links)
- On the bipanpositionable bipanconnectedness of hypercubes (Q1006052) (← links)
- On the spanning fan-connectivity of graphs (Q1028100) (← links)
- Mutually orthogonal Hamiltonian connected graphs (Q1033035) (← links)
- Mutually independent Hamiltonian cycles for the pancake graphs and the star graphs (Q1044915) (← links)
- On the extremal number of edges in Hamiltonian connected graphs (Q1049242) (← links)
- The extra connectivity, extra conditional diagnosability and \(t/k\)-diagnosability of the data center network DCell (Q1731845) (← links)
- A loopless algorithm for generating \((k, m)\)-ary trees in gray-code order (Q2037975) (← links)
- Efficient algorithms for support path with time constraint (Q2045049) (← links)
- A new structure for a vertex to be locally \(t\)-diagnosable in large multiprocessor systems (Q2089071) (← links)
- Diagnosability for two families of composition networks (Q2182326) (← links)
- Note on \(R_g\)-conditional diagnosability of hypercube (Q2215979) (← links)
- Super fault-tolerance assessment of locally twisted cubes based on the structure connectivity (Q2232604) (← links)
- 4-ordered-Hamiltonian problems of the generalized Petersen graph image (Q2256415) (← links)
- Reliability analysis of data center networks based on precise and imprecise diagnosis strategies (Q2290628) (← links)
- An improved algorithm to construct edge-independent spanning trees in augmented cubes (Q2306584) (← links)
- The diagnosability of triangle-free graphs (Q2440166) (← links)
- On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube (Q2444140) (← links)
- Disjoint cycles in hypercubes with prescribed vertices in each cycle (Q2446892) (← links)
- The spanning laceability on the faulty bipartite hypercube-like networks (Q2451446) (← links)
- On spanning connected graphs (Q2470011) (← links)
- Fault-tolerant Hamiltonian connectedness of cycle composition networks (Q2474880) (← links)
- Cluster connectivity of hypercube-based networks under the super fault-tolerance condition (Q2659172) (← links)
- The component connectivity, component diagnosability, and \(t/k\)-diagnosability of bicube networks (Q2664955) (← links)
- A new measure for locally \(t\)-diagnosable under PMC model (Q2695297) (← links)
- (Q2804852) (← links)
- (Q2809932) (← links)
- (Q2839907) (← links)
- (Q2846630) (← links)
- Component connectivity of the hypercubes (Q2887029) (← links)
- (Q2936706) (← links)
- Cycles Embedding in Exchanged Crossed Cube (Q2979676) (← links)
- Fault-free mutually independent Hamiltonian cycles of faulty star graphs (Q2995474) (← links)
- The construction of mutually independent Hamiltonian cycles in bubble-sort graphs (Q3056358) (← links)
- (Q3110092) (← links)
- (Q3118590) (← links)