Yuan-Kang Shih

According to our database1, Yuan-Kang Shih authored at least 15 papers between 2008 and 2017.

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

2017
A study on degree characterization for hamiltonian-connected graphs.
Ars Comb., 2017

Energy-Efficient D2D Discovery for Energy-Harvesting Proximal IoT Devices.
Proceedings of the 85th IEEE Vehicular Technology Conference, 2017

2014
On the 1-fault hamiltonicity for graphs satisfying Ore's theorem and its generalization.
Int. J. Comput. Math., 2014

A Soft Fault Detection Mechanism with High Accuracy on Machine-to-Machine Communication Networks.
Proceedings of the 2014 IEEE International Conference on Internet of Things, 2014

2012
On the 1-fault hamiltonicity for graphs satisfying Ore's theorem.
Inf. Process. Lett., 2012

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

2011
One-to-one disjoint path covers on k-ary n-cubes.
Theor. Comput. Sci., 2011

2010
Mutually independent Hamiltonian cycles in dual-cubes.
J. Supercomput., 2010

The construction of mutually independent Hamiltonian cycles in bubble-sort graphs.
Int. J. Comput. Math., 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

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

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

2008
Hamiltonian Connectivity, Pancyclicity and 3^*-Connectivity of Matching Composition Networks.
J. Inf. Sci. Eng., 2008

Vertex-bipancyclicity of the generalized honeycomb tori.
Comput. Math. Appl., 2008


  Loading...