Shin-Shin Kao

Publication Activity (10 Years)

Years Active: 2003-2022
Publications (10 Years): 4

Top Topics

High Availability

Connected Graphs

Fault Tolerance

Hamiltonian Cycle

Top Venues

J. Inf. Sci. Eng.

Discret. Math. Theor. Comput. Sci.

Int. J. Comput. Math.

Publications

Hsiu-Chunj Pan, Hsun Su, Shin-Shin Kao
On the 2-Vertex-Fault Hamiltonicity for Graphs Satisfying Ore's Theorem. J. Inf. Sci. Eng. 38 (4) (2022)
Hsun Su, Hsiu-Chunj Pan, Shih-Yan Chen, Shin-Shin Kao
On mutually independent hamiltonian cycles. Ars Comb. 139 (2018)
Hsun Su, Yuan-Kang Shih, Shih-Yan Chen, Shin-Shin Kao
A study on degree characterization for hamiltonian-connected graphs. Ars Comb. 133 (2017)
Shih-Yan Chen, Shin-Shin Kao, Hsun Su
On degree-sequence characterization and the extremal number of edges for various Hamiltonian properties under fault tolerance. Discret. Math. Theor. Comput. Sci. 17 (3) (2016)
Yuan-Kang Shih, Hsun Su, Shin-Shin Kao
On the 1-fault hamiltonicity for graphs satisfying Ore's theorem and its generalization. Int. J. Comput. Math. 91 (9) (2014)
Shin-Shin Kao, Hua-Min Huang, Kung-Ming Hsu, Lih-Hsing Hsu
Cubic 1-fault-tolerant hamiltonian graphs, Globally 3*-connected graphs, and Super 3-spanning connected graphs. Ars Comb. 110 (2013)
Shin-Shin Kao, Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu
Pancyclicity, Panconnectivity, and Panpositionability for General Graphs and Bipartite Graphs. Ars Comb. 105 (2012)
Hsun Su, Shih-Yan Chen, Shin-Shin Kao
Mutually independent Hamiltonian cycles in alternating group graphs. J. Supercomput. 61 (3) (2012)
Hsun Su, Yuan-Kang Shih, Shin-Shin Kao
On the 1-fault hamiltonicity for graphs satisfying Ore's theorem. Inf. Process. Lett. 112 (21) (2012)
Hsun Su, Jing-Ling Pan, Shin-Shin Kao
Mutually independent Hamiltonian cycles in k-ary n-cubes when k is even. Comput. Electr. Eng. 37 (3) (2011)
Yuan-Kang Shih, Shin-Shin Kao
One-to-one disjoint path covers on k-ary n-cubes. Theor. Comput. Sci. 412 (35) (2011)
Li-Yen Hsu, Feng-I Ling, Shin-Shin Kao, Hsun-Jung Cho
/2). Int. J. Comput. Math. 87 (15) (2010)
Yuan-Kang Shih, Hui-Chun Chuang, Shin-Shin Kao, Jimmy J. M. Tan
Mutually independent Hamiltonian cycles in dual-cubes. J. Supercomput. 54 (2) (2010)
Shih-Yan Chen, Shin-Shin Kao
Hamiltonian connectivity and globally 3*-connectivity of dual-cube extensive networks. Comput. Electr. Eng. 36 (3) (2010)
Shin-Shin Kao, Hong-Chun Hsu, Lih-Hsing Hsu
-connected graphs. Discret. Math. 309 (8) (2009)
Yuan-Kang Shih, Yi-Chien Wu, Shin-Shin Kao, Jimmy J. M. Tan
Vertex-bipancyclicity of the generalized honeycomb tori. Comput. Math. Appl. 56 (11) (2008)
Shin-Shin Kao, Jui-Chia Wu, Yuan-Kang Shih
Hamiltonian Connectivity, Pancyclicity and 3^*-Connectivity of Matching Composition Networks. J. Inf. Sci. Eng. 24 (2) (2008)
Li-Yen Hsu, Shin-Shin Kao
Extending Security/Sustainability through Pervasive Spider Web Networks in Urbanism. Security and Management (2007)
Shin-Shin Kao, Kung-Ming Hsu, Lih-Hsing Hsu
Cubic planar hamiltonian graphs of various types. Discret. Math. 306 (13) (2006)
Shin-Shin Kao, Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu
Panpositionable Hamiltonian Graphs. Ars Comb. 81 (2006)
Li-Yen Hsu, Shin-Shin Kao
Developing Dual-Surveillance Based Vehicle Security Management with Generalized Honeycomb Tori. Security and Management (2006)
Shin-Shin Kao, Lih-Hsing Hsu
The globally bi-3* and hyper bi-3* connectedness of the spider web networks. Appl. Math. Comput. 170 (1) (2005)
Shin-Shin Kao, Lih-Hsing Hsu
Spider web networks: a family of optimal, fault tolerant, hamiltonian bipartite graphs. Appl. Math. Comput. 160 (1) (2005)
Shin-Shin Kao, Lih-Hsing Hsu
-hamiltonian and 1-edge hamiltonian graphs. Inf. Process. Lett. 86 (5) (2003)
Y-Chuang Chen, Jimmy J. M. Tan, Lih-Hsing Hsu, Shin-Shin Kao
Super-connectivity and super-edge-connectivity for some interconnection networks. Appl. Math. Comput. 140 (2-3) (2003)