Super-connectivity and super-edge-connectivity for some interconnection networks. - Y-Chuang Chen; Jimmy J. M. Tan; Lih-Hsing Hsu; Shin-Shin Kao (Appl. Math. Comput., 2003)

Brother trees: A family of optimal 1p-hamiltonian and 1-edge hamiltonian graphs. - Shin-Shin Kao; Lih-Hsing Hsu (Inf. Process. Lett., 2003)

Spider web networks: a family of optimal, fault tolerant, hamiltonian bipartite graphs. - Shin-Shin Kao; Lih-Hsing Hsu (Appl. Math. Comput., 2005)

The globally bi-3* and hyper bi-3* connectedness of the spider web networks. - Shin-Shin Kao; Lih-Hsing Hsu (Appl. Math. Comput., 2005)

Developing Dual-Surveillance Based Vehicle Security Management with Generalized Honeycomb Tori. - Li-Yen Hsu; Shin-Shin Kao (Security and Management, 2006)

Panpositionable Hamiltonian Graphs. - Shin-Shin Kao; Cheng-Kuan Lin; Hua-Min Huang; Lih-Hsing Hsu (Ars Comb., 2006)

Cubic planar hamiltonian graphs of various types. - Shin-Shin Kao; Kung-Ming Hsu; Lih-Hsing Hsu (Discret. Math., 2006)

Extending Security/Sustainability through Pervasive Spider Web Networks in Urbanism. - Li-Yen Hsu; Shin-Shin Kao (Security and Management, 2007)

Vertex-bipancyclicity of the generalized honeycomb tori. - Yuan-Kang Shih; Yi-Chien Wu; Shin-Shin Kao; Jimmy J. M. Tan (Comput. Math. Appl., 2008)

Hamiltonian Connectivity, Pancyclicity and 3^*-Connectivity of Matching Composition Networks. - Shin-Shin Kao; Jui-Chia Wu; Yuan-Kang Shih (J. Inf. Sci. Eng., 2008)

Globally bi-3*-connected graphs. - Shin-Shin Kao; Hong-Chun Hsu; Lih-Hsing Hsu (Discret. Math., 2009)

Hamiltonian connectivity and globally 3*-connectivity of dual-cube extensive networks. - Shih-Yan Chen; Shin-Shin Kao (Comput. Electr. Eng., 2010)

Ring embedding in faulty generalized honeycomb torus - GHT(m, n, n/2). - Li-Yen Hsu; Feng-I Ling; Shin-Shin Kao; Hsun-Jung Cho (Int. J. Comput. Math., 2010)

Mutually independent Hamiltonian cycles in dual-cubes. - Yuan-Kang Shih; Hui-Chun Chuang; Shin-Shin Kao; Jimmy J. M. Tan (J. Supercomput., 2010)

Mutually independent Hamiltonian cycles in k-ary n-cubes when k is even. - Hsun Su; Jing-Ling Pan; Shin-Shin Kao (Comput. Electr. Eng., 2011)

One-to-one disjoint path covers on k-ary n-cubes. - Yuan-Kang Shih; Shin-Shin Kao (Theor. Comput. Sci., 2011)

Pancyclicity, Panconnectivity, and Panpositionability for General Graphs and Bipartite Graphs. - Shin-Shin Kao; Cheng-Kuan Lin; Hua-Min Huang; Lih-Hsing Hsu (Ars Comb., 2012)

On the 1-fault hamiltonicity for graphs satisfying Ore's theorem. - Hsun Su; Yuan-Kang Shih; Shin-Shin Kao (Inf. Process. Lett., 2012)

Mutually independent Hamiltonian cycles in alternating group graphs. - Hsun Su; Shih-Yan Chen; Shin-Shin Kao (J. Supercomput., 2012)

Cubic 1-fault-tolerant hamiltonian graphs, Globally 3*-connected graphs, and Super 3-spanning connected graphs. - Shin-Shin Kao; Hua-Min Huang; Kung-Ming Hsu; Lih-Hsing Hsu (Ars Comb., 2013)

On the 1-fault hamiltonicity for graphs satisfying Ore's theorem and its generalization. - Yuan-Kang Shih; Hsun Su; Shin-Shin Kao (Int. J. Comput. Math., 2014)

On degree-sequence characterization and the extremal number of edges for various Hamiltonian properties under fault tolerance. - Shih-Yan Chen; Shin-Shin Kao; Hsun Su (Discret. Math. Theor. Comput. Sci., 2016)

A study on degree characterization for hamiltonian-connected graphs. - Hsun Su; Yuan-Kang Shih; Shih-Yan Chen; Shin-Shin Kao (Ars Comb., 2017)

On mutually independent hamiltonian cycles. - Hsun Su; Hsiu-Chunj Pan; Shih-Yan Chen; Shin-Shin Kao (Ars Comb., 2018)

On the 2-Vertex-Fault Hamiltonicity for Graphs Satisfying Ore's Theorem. - Hsiu-Chunj Pan; Hsun Su; Shin-Shin Kao (J. Inf. Sci. Eng., 2022)

Construction of cycles with various lengths in dual cube extensive networks. - Shin-Shin Kao (ICCE-Taiwan, 2024)