The following pages link to Lih-Hsing Hsu (Q194667):
Displaying 50 items.
- Faithful 1-edge fault tolerant graphs (Q286987) (← links)
- Optimal 1-Hamiltonian graphs (Q293225) (← links)
- Christmas tree: a versatile 1-fault-tolerant design for token rings (Q294701) (← 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 spanning connectivity of line graphs (Q548422) (← links)
- Embedding a Hamiltonian cycle in the crossed cube with two required vertices in the fixed positions (Q555427) (← links)
- The super connectivity of the pancake graphs and the super laceability of the star graphs (Q557901) (← links)
- Mutually independent bipanconnected property of hypercube (Q618099) (← links)
- The \(3^{*}\)-connected property of pyramid networks (Q623179) (← links)
- On 4-ordered 3-regular graphs (Q651443) (← links)
- Mutually independent Hamiltonian connectivity of \((n,k)\)-star graphs (Q659782) (← links)
- Element perturbation problems of optimum spanning trees with two-parameter objectives (Q674298) (← links)
- Fault-tolerant Hamiltonicity of twisted cubes (Q697012) (← links)
- Hyper Hamiltonian laceability on edge fault star graph (Q707305) (← 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)
- Generalized homomorphism graph functions (Q753838) (← links)
- On a multiplicative graph function conjecture (Q786831) (← links)
- A note on edge fault tolerance with respect to hypercubes (Q812673) (← links)
- The super laceability of the hypercubes (Q834885) (← links)
- Node-pancyclicity and edge-pancyclicity of hypercube variants (Q845952) (← links)
- On the spanning connectivity of graphs (Q864172) (← links)
- Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes (Q878678) (← links)
- Strong Menger connectivity with conditional faults on the class of hypercube-like networks (Q963334) (← links)
- Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position (Q963431) (← links)
- The bipanpositionable bipancyclic property of the hypercube (Q979832) (← links)
- Embedding Hamiltonian paths in augmented cubes with a required vertex in a fixed position (Q979841) (← links)
- Conditional fault hamiltonian connectivity of the complete graph (Q987830) (← links)
- The panpositionable panconnectedness of augmented cubes (Q991906) (← links)
- On the spanning connectivity and spanning laceability of hypercube-like networks (Q995576) (← links)
- On the bipanpositionable bipanconnectedness of hypercubes (Q1006052) (← links)
- Brother trees: A family of optimal \(1p\)-Hamiltonian and 1-edge Hamiltonian graphs (Q1007617) (← links)
- Ring embedding in faulty pancake graphs (Q1007619) (← links)
- Long paths in hypercubes with conditional node-faults (Q1010144) (← links)
- Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes (Q1014404) (← links)
- Globally bi-3*-connected graphs (Q1025446) (← links)
- On the spanning fan-connectivity of graphs (Q1028100) (← links)
- Fault-tolerant cycle-embedding of crossed cubes (Q1029001) (← 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)
- Dependence of tree copy functions (Q1058532) (← links)
- Finding the most vital edge with respect to minimum spanning tree in weighted graphs (Q1183410) (← links)
- The most vital edges with respect to the number of spanning trees in two- terminal series-parallel graphs (Q1198968) (← links)
- Parallel algorithms for finding the most vital edge with respect to minimum spanning tree (Q1201944) (← links)
- A note on the minimum cut cover of graphs (Q1342081) (← links)
- Super-connectivity and super-edge-connectivity for some interconnection networks (Q1406242) (← links)
- On some super fault-tolerant Hamiltonian graphs (Q1421270) (← links)
- The correct diameter of trivalent Cayley graphs. (Q1607004) (← links)
