| Publication | Date of Publication | Type |
|---|
Double declined subnetwork reliability analysis in bubble-sort networks under node fault model
Theoretical Computer Science | 2024-12-12 | Paper |
Hamiltonian laceability of hypercubes with prescribed linear forest and/or faulty edges
JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing | 2024-08-13 | Paper |
Hyper \(K_{1, r}\) and sub-\(K_{1, r}\) fault tolerance of star graphs
Discrete Applied Mathematics | 2023-12-11 | Paper |
Kite-group divisible packings and coverings with any minimum leave and minimum excess
Advances in Mathematics of Communications | 2023-07-07 | Paper |
Hyper star fault tolerance of bubble sort networks
Theoretical Computer Science | 2023-03-10 | Paper |
Embedded edge connectivity of \(k\)-ary \(n\)-cubes
Information Processing Letters | 2023-01-30 | Paper |
Fault-free Hamiltonian paths passing through prescribed linear forests in balanced hypercubes with faulty links
Theoretical Computer Science | 2022-11-17 | Paper |
Optimal edge fault-tolerant-prescribed hamiltonian laceability of balanced hypercubes
| 2022-07-25 | Paper |
Hybrid fault-tolerant prescribed hyper-Hamiltonian laceability of hypercubes
Theoretical Computer Science | 2021-09-27 | Paper |
Embedded connectivity of ternary \(n\)-cubes
Theoretical Computer Science | 2021-06-08 | Paper |
Super \(C_k\) and sub-\( C_k\) connectivity of \(k\)-ary \(n\)-cube networks
International Journal of Foundations of Computer Science | 2021-04-19 | Paper |
The 2-good-neighbor (2-extra) diagnosability of alternating group graph networks under the PMC model and MM\(^*\) model
Applied Mathematics and Computation | 2019-03-28 | Paper |
Embedding fault-free Hamiltonian paths with prescribed linear forests into faulty ternary \(n\)-cubes
Theoretical Computer Science | 2019-03-26 | Paper |
Fault-tolerant-prescribed Hamiltonian laceability of balanced hypercubes
Information Processing Letters | 2019-03-11 | Paper |
Hamiltonicity of the torus network under the conditional fault model
International Journal of Foundations of Computer Science | 2017-06-20 | Paper |
A note on Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube
Information Sciences | 2017-05-16 | Paper |
Embedding various cycles with prescribed paths into \(k\)-ary \(n\)-cubes
Discrete Applied Mathematics | 2017-02-06 | Paper |
Conditional connectivity of recursive interconnection networks respect to embedding restriction
Information Sciences | 2017-01-31 | Paper |
Hamiltonian path embeddings in conditional faulty \(k\)-ary \(n\)-cubes
Information Sciences | 2016-07-08 | Paper |
Panconnectivity and pancyclicity of the 3-ary \(n\)-cube network under the path restrictions
Applied Mathematics and Computation | 2016-04-29 | Paper |
2-edge connected dominating sets and 2-connected dominating sets of a graph
Journal of Combinatorial Optimization | 2016-02-23 | Paper |
Subnetwork preclusion for bubble-sort networks
Information Processing Letters | 2015-07-15 | Paper |
One-to-one disjoint path covers on multi-dimensional tori
International Journal of Computer Mathematics | 2015-04-27 | Paper |
Unchanging the diameter of \(k\)-ary \(n\)-cube networks with faulty vertices
International Journal of Computer Mathematics | 2015-03-25 | Paper |
Fault-free Hamiltonian cycles passing through a linear forest in ternary \(n\)-cubes with faulty edges
Theoretical Computer Science | 2013-12-17 | Paper |
Conditional connectivity of star graph networks under embedding restriction
Information Sciences | 2012-10-17 | Paper |
The isolated scattering number of graphs
Acta Mathematica Sinica. Chinese Series | 2012-06-01 | Paper |
Fault tolerance in bubble-sort graph networks
Theoretical Computer Science | 2012-03-13 | Paper |
Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes
Discrete Applied Mathematics | 2011-10-27 | Paper |
DNA algorithm of map coloring problem based on sticker model
| 2008-06-03 | Paper |
