Tung-Yang Ho

According to our database1, Tung-Yang Ho authored at least 26 papers between 1991 and 2014.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

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

2013
Changing the Diameter in a Diagonal Mesh Network.
J. Inf. Sci. Eng., 2013

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

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

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

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

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

Fault-Tolerant Hamiltonian Connectivity and Fault-Tolerant Hamiltonicity of the Fully Connected Cubic Networks.
J. Inf. Sci. Eng., 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

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
Diameter variability of cycles and tori.
Inf. Sci., 2008

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

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

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

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

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

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

1997
Multiple-Edge-Fault Tolerance with Respect to Hypercubes.
IEEE Trans. Parallel Distributed Syst., 1997

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

1996
Transmitting on various network topologies.
Networks, 1996

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

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


  Loading...