| Publication | Date of Publication | Type |
|---|
Using Node Diagnosability to Determine t-Diagnosability under the Comparison Diagnosis Model
IEEE Transactions on Computers | 2017-08-08 | Paper |
An Algorithmic Approach to Conditional-Fault Local Diagnosis of Regular Multiprocessor Interconnected Systems under the PMC Model
IEEE Transactions on Computers | 2017-07-12 | Paper |
Fault-tolerant Hamiltonian connectivity of the WK-recursive networks
Information Sciences | 2016-07-08 | Paper |
Maximally local connectivity and connected components of augmented cubes
Information Sciences | 2016-07-08 | Paper |
Conditional matching preclusion for the star graphs.
Ars Combinatoria | 2016-05-04 | Paper |
4-ordered-Hamiltonian problems of the generalized Petersen graph image
Mathematical and Computer Modelling | 2015-02-19 | Paper |
Conditional fault Hamiltonicity of the star graph.
| 2015-01-06 | Paper |
The spanning laceability on the faulty bipartite hypercube-like networks
Applied Mathematics and Computation | 2014-06-03 | Paper |
Disjoint cycles in hypercubes with prescribed vertices in each cycle
Discrete Applied Mathematics | 2014-04-23 | Paper |
Mutually independent Hamiltonian cycles in some graphs.
Ars Combinatoria | 2013-09-09 | Paper |
Super spanning connectivity of augmented cubes.
| 2013-03-21 | Paper |
The paths embedding of the arrangement graphs with prescribed vertices in given position
Journal of Combinatorial Optimization | 2013-01-03 | Paper |
Diagnosability of star graphs with missing edges
Information Sciences | 2012-10-02 | Paper |
The \(g\)-good-neighbor conditional diagnosability of hypercube under PMC model
Applied Mathematics and Computation | 2012-09-13 | Paper |
Solution to an open problem on 4-ordered Hamiltonian graphs
Discrete Mathematics | 2012-08-10 | Paper |
Component connectivity of the hypercubes
International Journal of Computer Mathematics | 2012-05-15 | Paper |
On the extremal number of edges in Hamiltonian graphs
| 2012-03-02 | Paper |
Hamiltonian connectedness of the generalized Petersen graph \(GP(n,4)\)
| 2012-01-26 | Paper |
Mutually independent Hamiltonian connectivity of \((n,k)\)-star graphs
Annals of Combinatorics | 2012-01-24 | Paper |
On 4-ordered 3-regular graphs
Mathematical and Computer Modelling | 2011-12-18 | Paper |
Fault-free mutually independent Hamiltonian cycles of faulty star graphs
International Journal of Computer Mathematics | 2011-04-21 | Paper |
scientific article; zbMATH DE number 5864763 (Why is no real title available?)
| 2011-03-10 | Paper |
Mutually independent bipanconnected property of hypercube
Applied Mathematics and Computation | 2011-01-14 | Paper |
The construction of mutually independent Hamiltonian cycles in bubble-sort graphs
International Journal of Computer Mathematics | 2010-11-12 | Paper |
Conditional fault hamiltonian connectivity of the complete graph
Information Processing Letters | 2010-08-16 | Paper |
Embedding Hamiltonian paths in augmented cubes with a required vertex in a fixed position
Computers & Mathematics with Applications | 2010-06-28 | Paper |
The bipanpositionable bipancyclic property of the hypercube
Computers & Mathematics with Applications | 2010-06-28 | Paper |
Strong Menger connectivity with conditional faults on the class of hypercube-like networks
Information Processing Letters | 2010-04-19 | Paper |
Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position
Information Processing Letters | 2010-04-19 | Paper |
Edge-bipancyclicity of conditional faulty hypercubes
Information Processing Letters | 2010-03-24 | Paper |
On the extremal number of edges in Hamiltonian connected graphs
Applied Mathematics Letters | 2010-01-08 | Paper |
Mutually independent Hamiltonian cycles for the pancake graphs and the star graphs
Discrete Mathematics | 2009-12-15 | Paper |
Mutually orthogonal Hamiltonian connected graphs
Applied Mathematics Letters | 2009-11-06 | Paper |
A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
Journal of Combinatorial Optimization | 2009-10-09 | Paper |
The super-connected property of recursive circulant graphs
Information Processing Letters | 2009-07-21 | Paper |
Vertex-bipancyclicity of the generalized honeycomb tori
Computers & Mathematics with Applications | 2009-07-17 | Paper |
Fault-tolerant cycle-embedding of crossed cubes
Information Processing Letters | 2009-07-09 | Paper |
On the spanning fan-connectivity of graphs
Discrete Applied Mathematics | 2009-06-30 | Paper |
Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
Information Processing Letters | 2009-04-28 | Paper |
Long paths in hypercubes with conditional node-faults
Information Sciences | 2009-04-03 | Paper |
A tree labeling problem
| 2009-03-26 | Paper |
On the bipanpositionable bipanconnectedness of hypercubes
Theoretical Computer Science | 2009-03-17 | Paper |
Fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks
International Journal of Computer Mathematics | 2009-02-18 | Paper |
Panpositionable hamiltonicity and panconnectivity of the arrangement graphs
Applied Mathematics and Computation | 2008-04-17 | Paper |
Fault-tolerant Hamiltonian connectedness of cycle composition networks
Applied Mathematics and Computation | 2008-03-06 | Paper |
On spanning connected graphs
Discrete Mathematics | 2008-02-11 | Paper |
The globally bi-\(3^{*}\)-connected property of the honeycomb rectangular torus
Information Sciences | 2008-01-03 | Paper |
Panpositionable hamiltonicity of the alternating group graphs
Networks | 2007-09-21 | Paper |
On the spanning connectivity and spanning laceability of hypercube-like networks
Theoretical Computer Science | 2007-09-03 | Paper |
Restricted connectivity for three families of interconnection networks
Applied Mathematics and Computation | 2007-07-10 | Paper |
Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
Journal of Parallel and Distributed Computing | 2007-04-26 | Paper |
A recursively construction scheme for super fault-tolerant Hamiltonian graphs
Applied Mathematics and Computation | 2006-08-04 | Paper |
On embedding cycles into faulty twisted cubes
Information Sciences | 2006-05-11 | Paper |
On mutually independent Hamiltonian paths
Applied Mathematics Letters | 2006-05-11 | Paper |
Hyper Hamiltonian laceability on edge fault star graph
Information Sciences | 2005-02-09 | Paper |
Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
Networks | 2004-02-03 | Paper |
On some super fault-tolerant Hamiltonian graphs
Applied Mathematics and Computation | 2004-01-26 | Paper |
scientific article; zbMATH DE number 1990709 (Why is no real title available?)
| 2003-10-13 | Paper |
Super-connectivity and super-edge-connectivity for some interconnection networks
Applied Mathematics and Computation | 2003-09-09 | Paper |
Fault-tolerant Hamiltonian laceability of hypercubes.
Information Processing Letters | 2003-01-21 | Paper |
Fault-tolerant Hamiltonicity of twisted cubes
Journal of Parallel and Distributed Computing | 2002-09-12 | Paper |
The shuffle-cubes and their generalization
Information Processing Letters | 2002-07-25 | Paper |
Routing properties of supercubes
Information Sciences | 2001-07-29 | Paper |
Construction schemes for fault-tolerant Hamiltonian graphs
| 2000-07-09 | Paper |
A generalization of the stable matching problem
Discrete Applied Mathematics | 1995-05-17 | Paper |
Stable matchings and stable partitions∗
International Journal of Computer Mathematics | 1992-06-28 | Paper |
A necessary and sufficient condition for the existence of a complete stable matching
Journal of Algorithms | 1991-01-01 | Paper |
A maximum stable matching for the roommates problem
BIT | 1990-01-01 | Paper |
