Lih-Hsing Hsu

According to our database1, Lih-Hsing Hsu authored at least 184 papers between 1983 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Three Types of Two-Disjoint-Cycle-Cover Pancyclicity and Their Applications to Cycle Embedding in Locally Twisted Cubes.
Comput. J., 2021

2020
The Conditional-(<i>g</i>, <i>d</i>, <i>k</i>)-Connectivity and Conditional-(<i>g</i>, <i>d</i>, <i>k</i>)-edge-Connectivity on the Hypercubes.
Fundam. Informaticae, 2020

2-spanning cyclability problems of the some generalized Petersen graphs.
Discuss. Math. Graph Theory, 2020

2019
Theoretical analysis of shortest-path congestion unidirectional hypercubes<sup>*</sup>.
Proceedings of the 20th IEEE/ACIS International Conference on Software Engineering, 2019

2018
On the spanning connectivity of the generalized Petersen graphs P(n,3).
Discret. Math., 2018

An Augmented Pancyclicity Problem of Crossed Cubes.
Comput. J., 2018

Fault-Hamiltonicity of Cartesian products of directed cycles.
Art Discret. Appl. Math., 2018

2017
Strong Fault-Hamiltonicity for the Crossed Cube and Its Extensions.
Parallel Process. Lett., 2017

The Arcs Fault-Tolerance for 4-Pancyclic Properties of Unidirectional Hypercubes.
Proceedings of the 5th International Conference on Applied Computing and Information Technology, 2017

2016
On the Robust Approach to Data Inconsistency Detection of Sensor Networks.
Proceedings of the 10th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, 2016

A Framework of Cycle-Based Clustering on the Crossed Cube Architecture.
Proceedings of the 10th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, 2016

On Developing the Learning Game for Graph Theory: A New Design Model Considering the Learners' Reflexiveness.
Proceedings of the 5th IIAI International Congress on Advanced Applied Informatics, 2016

2015
On Hamiltonian properties of unidirectional hypercubes.
Inf. Process. Lett., 2015

Conditional Matching Preclusion For The Star Graphs.
Ars Comb., 2015

2014
On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube.
J. Comb. Optim., 2014

Fault-tolerant hamiltonian connectivity of the WK-recursive networks.
Inf. Sci., 2014

Cycles in cube-connected cycles graphs.
Discret. Appl. Math., 2014

Conditional Fault Hamiltonicity of the Star Graph.
Ars Comb., 2014

Toward the One-to-Two Balanced Disjoint-Path Cover of Matching Composition Networks.
Proceedings of the Intelligent Systems and Applications, 2014

Conditional Connectivity with Distance Requirement on Hypercube.
Proceedings of the 17th IEEE International Conference on Computational Science and Engineering, 2014

2013
Local Diagnosis Algorithms for Multiprocessor Systems Under the Comparison Diagnosis Model.
IEEE Trans. Reliab., 2013

4-ordered-Hamiltonian problems of the generalized Petersen graph <i>GP</i>(<i>n</i>, 4).
Math. Comput. Model., 2013

Disjoint cycles in hypercubes with prescribed vertices in each cycle.
Discret. Appl. Math., 2013

Cubic 1-fault-tolerant hamiltonian graphs, Globally 3*-connected graphs, and Super 3-spanning connected graphs.
Ars Comb., 2013

The spanning laceability on the faulty bipartite hypercube-like networks.
Appl. Math. Comput., 2013

2012
The paths embedding of the arrangement graphs with prescribed vertices in given position.
J. Comb. Optim., 2012

Component connectivity of the hypercubes.
Int. J. Comput. Math., 2012

Solution to an open problem on 4-ordered Hamiltonian graphs.
Discret. Math., 2012

Mutually Independent Hamiltonian Cycles in Some Graphs.
Ars Comb., 2012

Super Spanning Connectivity of Augmented Cubes.
Ars Comb., 2012

Pancyclicity, Panconnectivity, and Panpositionability for General Graphs and Bipartite Graphs.
Ars Comb., 2012

The g-good-neighbor conditional diagnosability of hypercube under PMC model.
Appl. Math. Comput., 2012

2011
On 4-ordered 3-regular graphs.
Math. Comput. Model., 2011

On the Extremal Number of Edges in Hamiltonian Graphs.
J. Inf. Sci. Eng., 2011

Fault-free mutually independent Hamiltonian cycles of faulty star graphs.
Int. J. Comput. Math., 2011

Mutually Independent Hamiltonian Cycle of Burnt Pancake Graphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011

The spanning connectivity of line graphs.
Appl. Math. Lett., 2011

Embedding a Hamiltonian cycle in the crossed cube with two required vertices in the fixed positions.
Appl. Math. Comput., 2011

Embedding Cycles into Hypercubes with Prescribe Vertices in the Specific Order.
Proceedings of the 14th IEEE International Conference on Computational Science and Engineering, 2011

2010
A family of Hamiltonian and Hamiltonian connected graphs with fault tolerance.
J. Supercomput., 2010

4-Ordered Hamiltonicity for Some Chordal Ring Graphs.
J. Interconnect. Networks, 2010

On the Existence of Disjoint Spanning Paths in Faulty Hypercubes.
J. Interconnect. Networks, 2010

Super Spanning Connectivity of the Fully Connected cubic Networks.
J. Interconnect. Networks, 2010

The panpositionable panconnectedness of augmented cubes.
Inf. Sci., 2010

The construction of mutually independent Hamiltonian cycles in bubble-sort graphs.
Int. J. Comput. Math., 2010

The 3<sup>*</sup>-connected property of pyramid networks.
Comput. Math. Appl., 2010

On the extremal number of edges in hamiltonian connected graphs.
Appl. Math. Lett., 2010

Mutually independent bipanconnected property of hypercube.
Appl. Math. Comput., 2010

Two Spanning Disjoint Paths with Required Length in Arrangement Graphs.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2010

The Diagnosability of g-good-neighbor Conditional-Faulty Hypercube under PMC Model.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2010

2009
The super spanning connectivity and super spanning laceability of the enhanced hypercubes.
J. Supercomput., 2009

On the bipanpositionable bipanconnectedness of hypercubes.
Theor. Comput. Sci., 2009

Embedding paths of variable lengths into hypercubes with conditional link-faults.
Parallel Comput., 2009

Conditional diagnosability of hypercubes under the comparison diagnosis model.
J. Syst. Archit., 2009

Fault-Tolerant Maximal Local-Connectivity on Cayley Graphs Generated by Transposition Trees.
J. Interconnect. Networks, 2009

Fault-Tolerant Hamiltonian laceability and Fault-Tolerant Conditional Hamiltonian for Bipartite Hypercube-like Networks.
J. Interconnect. Networks, 2009

A New Isomorphic Definition of the Crossed Cube and its Spanning Connectivity.
J. Interconnect. Networks, 2009

A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges.
J. Comb. Optim., 2009

Long paths in hypercubes with conditional node-faults.
Inf. Sci., 2009

Conditional fault hamiltonian connectivity of the complete graph.
Inf. Process. Lett., 2009

Fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks.
Int. J. Comput. Math., 2009

The Spanning Connectivity of the Burnt Pancake Graphs.
IEICE Trans. Inf. Syst., 2009

Mutually independent hamiltonian cycles for the pancake graphs and the star graphs.
Discret. Math., 2009

Globally bi-3<sup>*</sup>-connected graphs.
Discret. Math., 2009

On the spanning fan-connectivity of graphs.
Discret. Appl. Math., 2009

The bipanpositionable bipancyclic property of the hypercube.
Comput. Math. Appl., 2009

Embedding Hamiltonian paths in augmented cubes with a required vertex in a fixed position.
Comput. Math. Appl., 2009

Mutually orthogonal hamiltonian connected graphs.
Appl. Math. Lett., 2009

Fault-Tolerant Hamiltonicity of the WK-Recursive Networks.
Proceedings of the 10th International Symposium on Pervasive Systems, 2009

2008
Mutually independent hamiltonian cycles of binary wrapped butterfly graphs.
Math. Comput. Model., 2008

Conditional Diagnosability of Cayley Graphs Generated by Transposition Trees under the Comparison Diagnosis Model.
J. Interconnect. Networks, 2008

Strong Menger connectivity with conditional faults on the class of hypercube-like networks.
Inf. Process. Lett., 2008

Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position.
Inf. Process. Lett., 2008

On spanning connected graphs.
Discret. Math., 2008

Hyper-Hamiltonian generalized Petersen graphs.
Comput. Math. Appl., 2008

Panpositionable hamiltonicity and panconnectivity of the arrangement graphs.
Appl. Math. Comput., 2008

Fault-tolerant hamiltonian connectedness of cycle composition networks.
Appl. Math. Comput., 2008

Mutually Independent Hamiltonianicity of Pancake Graphs and Star Graphs.
Proceedings of the 9th International Symposium on Parallel Architectures, 2008

On the Longest Fault-Free Paths in Hypercubes with More Faulty Nodes.
Proceedings of the 9th International Symposium on Parallel Architectures, 2008

2007
On the spanning connectivity and spanning laceability of hypercube-like networks.
Theor. Comput. Sci., 2007

Panpositionable hamiltonicity of the alternating group graphs.
Networks, 2007

Highly fault-tolerant cycle embeddings of hypercubes.
J. Syst. Archit., 2007

Hamiltonian circuit and linear array embeddings in faulty k-ary n-cubes.
J. Parallel Distributed Comput., 2007

Hamiltonian laceability of Faulty Hypercubes.
J. Interconnect. Networks, 2007

Hamiltonicity of hypercubes with a constraint of required and faulty edges.
J. Comb. Optim., 2007

On cubic 2-independent Hamiltonian connected graphs.
J. Comb. Optim., 2007

On the equitable <i>k</i> <sup>*</sup>-laceability of hypercubes.
J. Comb. Optim., 2007

The globally Bi-3<sup>*</sup>-connected property of the honeycomb rectangular torus.
Inf. Sci., 2007

Edge-bipancyclicity of conditional faulty hypercubes.
Inf. Process. Lett., 2007

Node-pancyclicity and edge-pancyclicity of hypercube variants.
Inf. Process. Lett., 2007

On the spanning connectivity of graphs.
Discret. Math., 2007

2006
On the spanning <i>w</i>-wide diameter of the star graph.
Networks, 2006

Mutually Independent Hamiltonian Paths and Cycles in Hypercubes.
J. Interconnect. Networks, 2006

On embedding cycles into faulty twisted cubes.
Inf. Sci., 2006

The Spanning Connectivity of the (n, k)-star Graphs.
Int. J. Found. Comput. Sci., 2006

Cubic planar hamiltonian graphs of various types.
Discret. Math., 2006

Panpositionable Hamiltonian Graphs.
Ars Comb., 2006

On mutually independent hamiltonian paths.
Appl. Math. Lett., 2006

A recursively construction scheme for super fault-tolerant hamiltonian graphs.
Appl. Math. Comput., 2006

The Globally Bi-3*-Connected Property of the Brother Trees.
Proceedings of the 2006 Joint Conference on Information Sciences, 2006

2005
The super connectivity of the pancake graphs and the super laceability of the star graphs.
Theor. Comput. Sci., 2005

Conditional Diagnosability Measures for Large Multiprocessor Systems.
IEEE Trans. Computers, 2005

Honeycomb rectangular disks.
Parallel Comput., 2005

Fault hamiltonicity of augmented cubes.
Parallel Comput., 2005

Mutually independent hamiltonian paths in star networks.
Networks, 2005

Fault-Tolerant Pancyclicity of the Möbius Cubes.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

A note on edge fault tolerance with respect to hypercubes.
Appl. Math. Lett., 2005

The globally bi-3* and hyper bi-3* connectedness of the spider web networks.
Appl. Math. Comput., 2005

Spider web networks: a family of optimal, fault tolerant, hamiltonian bipartite graphs.
Appl. Math. Comput., 2005

Cycles in Highly Faulty Hypercubes.
Proceedings of The 2005 International Conference on Foundations of Computer Science, 2005

2004
The Diagnosability of the Matching Composition Network under the Comparison Diagnosis Model.
IEEE Trans. Computers, 2004

Fault Hamiltonicity and Fault Hamiltonian Connectivity of the Arrangement Graphs.
IEEE Trans. Computers, 2004

Diagnosability of t-Connected Networks and Product Networks under the Comparison Diagnosis Model.
IEEE Trans. Computers, 2004

Hyper hamiltonian laceability on edge fault star graph.
Inf. Sci., 2004

The super-connected property of recursive circulant graphs.
Inf. Process. Lett., 2004

The super laceability of the hypercubes.
Inf. Process. Lett., 2004

On some super fault-tolerant Hamiltonian graphs.
Appl. Math. Comput., 2004

The Spanning Diameter of the Star Graphs.
Proceedings of the 7th International Symposium on Parallel Architectures, 2004

Ring Embedding in Faulty Augmented Cubes.
Proceedings of the 7th International Symposium on Parallel Architectures, 2004

2003
Cycle embedding in faulty wrapped butterfly graphs.
Networks, 2003

Fault Hamiltonicity and fault Hamiltonian connectivity of the (n, k)-star graphs.
Networks, 2003

Fault-tolerant cycle-embedding of crossed cubes.
Inf. Process. Lett., 2003

Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes.
Inf. Process. Lett., 2003

Brother trees: A family of optimal 1<sub>p</sub>-hamiltonian and 1-edge hamiltonian graphs.
Inf. Process. Lett., 2003

Ring embedding in faulty pancake graphs.
Inf. Process. Lett., 2003

Super-connectivity and super-edge-connectivity for some interconnection networks.
Appl. Math. Comput., 2003

2002
Fault-Tolerant Hamiltonicity of Twisted Cubes.
J. Parallel Distributed Comput., 2002

Hamiltonian Properties of Faulty Recursive Circulant Graphs.
J. Interconnect. Networks, 2002

Fault-tolerant hamiltonian laceability of hypercubes.
Inf. Process. Lett., 2002

Optimal 1-edge fault-tolerant designs for ladders.
Inf. Process. Lett., 2002

On the Fault-Tolerant Hamiltonicity of Faulty Crossed Cubes.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002

A note on the ultimate categorical matching in a graph.
Discret. Math., 2002

Embedding Hamiltonian Paths and Hamiltonian Cycles in Faulty Pancake Graphs.
Proceedings of the International Symposium on Parallel Architectures, 2002

Hamiltonian laceability on edge fault star graph.
Proceedings of the 9th International Conference on Parallel and Distributed Systems, 2002

Adaptive Path-Based Multicast on Wormhole-Routed Hypercubes.
Proceedings of the Euro-Par 2002, 2002

2001
Optimal Processor Mapping for Linear-Complement Communication on Hypercubes.
IEEE Trans. Parallel Distributed Syst., 2001

On the construction of combined k-fault-tolerant Hamiltonian graphs.
Networks, 2001

A Family of Trivalent 1-Hamiltonia Graphs With Diameter O(log n).
J. Inf. Sci. Eng., 2001

Routing properties of supercubes.
Inf. Sci., 2001

The shuffle-cubes and their generalization.
Inf. Process. Lett., 2001

Additive multiplicative increasing functions on nonnegative square matrices and multidigraphs.
Discret. Math., 2001

2000
On the Isomorphism between Cyclic-Cubes and Wrapped Butterfly Networks.
IEEE Trans. Parallel Distributed Syst., 2000

Edge Congestion and Topological Properties of Crossed Cubes.
IEEE Trans. Parallel Distributed Syst., 2000

Construction schemes for fault-tolerant Hamiltonian graphs.
Networks, 2000

Optimum Congested Routing Strategy on Twisted Cubes.
J. Interconnect. Networks, 2000

Optimal k-Fault-Tolerant Networks for Token Rings.
J. Inf. Sci. Eng., 2000

Fault-Free Hamiltonian Cycle in Faulty Möbius Cubes.
Computación y Sistemas, 2000

1999
Fault Diameter for Subercubes.
Parallel Process. Lett., 1999

Topological Properties of Twisted Cube.
Inf. Sci., 1999

The correct diameter of trivalent Cayley graphs.
Inf. Process. Lett., 1999

Christmas Tree: A Versatile 1-Fault-Tolerant Design for Token Rings.
Inf. Process. Lett., 1999

1998
The Recognition of Double Euler Trails in Series-Parallel Networks.
J. Algorithms, 1998

Optimal 1-Hamiltonian Graphs.
Inf. Process. Lett., 1998

Fault Tolerant Token Ring Embedding in Double Loop Networks.
Inf. Process. Lett., 1998

Depth Contention-free Broadcasting on Torus Networks.
Proceedings of the 12th international conference on Supercomputing, 1998

Christmas Tree: A 1-Fault-Tolerant Network for Token Rings.
Proceedings of the International Conference on Parallel and Distributed Systems, 1998

Broadcasting on Wormhole-Routed 2D Tori with Arbitrary Size.
Proceedings of the International Conference on Parallel and Distributed Systems, 1998

A New Family of Optimal 1-Hamiltonian Graphs with Small Diameter.
Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1997
Extended Tree Contraction for Some parallel Algorithms on Series-Parallel Networks.
J. Inf. Sci. Eng., 1997

Faithful 1-Edge Fault Tolerant Graphs.
Inf. Process. Lett., 1997

A new shortest path routing algorithm and embedding cycles of crossed cube.
Proceedings of the 1997 International Symposium on Parallel Architectures, 1997

Projective Torus Networks.
Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996
On minimal cost-reliability ratio spanning trees and related problems.
Oper. Res. Lett., 1996

A response to Volgenant's Addendum on the most vital edges.
Networks, 1996

Transmitting on various network topologies.
Networks, 1996

Maximum and Minimum Matchings for Seriew-Parallel Networks.
J. Inf. Sci. Eng., 1996

A classification of graph capacity functions.
J. Graph Theory, 1996

1995
Element Perturbation Problems of Optimum Spanning Trees with Two-Parameter Objectives.
Inf. Process. Lett., 1995

1994
1-Edge Fault-Tolerant designs for Meshes.
Parallel Process. Lett., 1994

A note on the minimum cut cover of graphs.
Oper. Res. Lett., 1994

1993
Matching Polynomials of Series-Parallel Graphs.
Parallel Process. Lett., 1993

The most vital edges of matching in a bipartite graph.
Networks, 1993

1992
Parallel algorithms for finding the most vital edge with respect to minimum spanning tree.
Parallel Comput., 1992

The Most Vital Edges with Respect to the Number of Spanning Trees in Two-Terminal Series-Parallel Graphs.
BIT, 1992

Data Structure for Graph Representations of a Network Having Double Euler Trails.
Proceedings of the Algorithms, Software, Architecture, 1992

Maximum and Minimum Matchings for Series-Parallel Networks.
Proceedings of the Computing and Information, 1992

1991
Maximum independent number for series-parallel networks.
Networks, 1991

Finding the Most Vital Edge with Respect to Minimum Spanning Tree in Weighted Graphs.
Inf. Process. Lett., 1991

A Linear Time Algorithm to Recognize the Double Euler Trail for Series-Parallel Networks.
Proceedings of the ISA '91 Algorithms, 1991

Undordered Tree Contraction.
Proceedings of the Advances in Computing and Information, 1991

1990
Generalized homomorphism graph functions.
Discret. Math., 1990

1987
A class of additive multiplicative graph functions.
Discret. Math., 1987

1985
Dependence of tree copy functions.
Discret. Math., 1985

1983
On a multiplicative graph function conjecture.
Discret. Math., 1983


  Loading...