| Publication | Date of Publication | Type |
|---|
The conditional-\((g,d,k)\)-connectivity and conditional-\((g,d,k)\)-edge-connectivity on the hypercubes
Fundamenta Informaticae | 2020-11-16 | Paper |
2-spanning cyclability problems of some generalized Petersen graphs
Discussiones Mathematicae Graph Theory | 2020-04-28 | Paper |
Fault-Hamiltonicity of Cartesian products of directed cycles
The Art of Discrete and Applied Mathematics | 2019-10-02 | Paper |
On the spanning connectivity of the generalized Petersen graphs \(P(n, 3)\)
Discrete Mathematics | 2018-01-19 | Paper |
Strong fault-Hamiltonicity for the crossed cube and its extensions
Parallel Processing Letters | 2017-12-15 | Paper |
Infinitely many equivalent versions of the graceful tree conjecture
Applicable Analysis and Discrete Mathematics | 2017-07-19 | Paper |
Fault-tolerant Hamiltonian connectivity of the WK-recursive networks
Information Sciences | 2016-07-08 | Paper |
Christmas tree: a versatile 1-fault-tolerant design for token rings
Information Processing Letters | 2016-06-16 | Paper |
Optimal 1-Hamiltonian graphs
Information Processing Letters | 2016-06-09 | Paper |
On the cyclability of graphs
JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing | 2016-05-30 | Paper |
Faithful 1-edge fault tolerant graphs
Information Processing Letters | 2016-05-26 | Paper |
Conditional matching preclusion for the star graphs.
Ars Combinatoria | 2016-05-04 | Paper |
On Hamiltonian properties of unidirectional hypercubes
Information Processing Letters | 2015-05-21 | 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 |
scientific article; zbMATH DE number 6346404 (Why is no real title available?)
| 2014-09-19 | 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 |
On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube
Journal of Combinatorial Optimization | 2014-04-08 | Paper |
Cycles in cube-connected cycles graphs
Discrete Applied Mathematics | 2014-03-27 | Paper |
Mutually independent Hamiltonian cycles in some graphs.
Ars Combinatoria | 2013-09-09 | Paper |
Pancyclicity, panconnectivity, and panpositionability for general graphs and bipartite graphs.
Ars Combinatoria | 2013-07-16 | 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 |
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 |
Embedding a Hamiltonian cycle in the crossed cube with two required vertices in the fixed positions
Applied Mathematics and Computation | 2011-07-22 | Paper |
The spanning connectivity of line graphs
Applied Mathematics Letters | 2011-06-28 | Paper |
Fault-free mutually independent Hamiltonian cycles of faulty star graphs
International Journal of Computer Mathematics | 2011-04-21 | Paper |
The \(3^{*}\)-connected property of pyramid networks
Computers & Mathematics with Applications | 2011-02-13 | 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 |
The panpositionable panconnectedness of augmented cubes
Information Sciences | 2010-09-08 | 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 |
Node-pancyclicity and edge-pancyclicity of hypercube variants
Information Processing Letters | 2010-01-29 | 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 laceability of the hypercubes
Information Processing Letters | 2009-08-27 | Paper |
The super-connected property of recursive circulant graphs
Information Processing Letters | 2009-07-21 | Paper |
Mutually independent Hamiltonian cycles of binary wrapped butterfly graphs
Mathematical and Computer Modelling | 2009-07-19 | 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 |
Globally bi-3*-connected graphs
Discrete Mathematics | 2009-06-19 | 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 |
Ring embedding in faulty pancake graphs
Information Processing Letters | 2009-03-23 | Paper |
Brother trees: A family of optimal \(1p\)-Hamiltonian and 1-edge Hamiltonian graphs
Information Processing Letters | 2009-03-23 | 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 |
Graph theory and interconnection networks.
| 2008-12-08 | Paper |
Hyper-Hamiltonian generalized Petersen graphs
Computers & Mathematics with Applications | 2008-05-05 | 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 cubic 2-independent Hamiltonian connected graphs
Journal of Combinatorial Optimization | 2008-02-18 | Paper |
Hamiltonicity of hypercubes with a constraint of required and faulty edges
Journal of Combinatorial Optimization | 2008-02-18 | Paper |
On the equitable \(k^{*}\)-laceability of hypercubes
Journal of Combinatorial Optimization | 2008-02-18 | 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 |
Panpositionable Hamiltonian graphs.
| 2007-09-21 | Paper |
On the spanning connectivity and spanning laceability of hypercube-like networks
Theoretical Computer Science | 2007-09-03 | Paper |
Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
Journal of Parallel and Distributed Computing | 2007-04-26 | Paper |
On the spanning connectivity of graphs
Discrete Mathematics | 2007-02-13 | Paper |
On the spanningw-wide diameter of the star graph
Networks | 2007-02-02 | Paper |
Cubic planar Hamiltonian graphs of various types
Discrete Mathematics | 2006-08-04 | 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 |
THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS
International Journal of Foundations of Computer Science | 2006-05-10 | Paper |
A note on edge fault tolerance with respect to hypercubes
Applied Mathematics Letters | 2006-01-24 | Paper |
Fault tolerant token ring embedding in double loop networks.
Information Processing Letters | 2006-01-17 | Paper |
The globally bi-\(3^*\) and hyper bi-\(3^*\) connectedness of the spider web networks
Applied Mathematics and Computation | 2005-11-14 | Paper |
Mutually independent hamiltonian paths in star networks
Networks | 2005-09-22 | Paper |
The super connectivity of the pancake graphs and the super laceability of the star graphs
Theoretical Computer Science | 2005-06-30 | Paper |
Spider web networks: a family of optimal, fault tolerant, Hamiltonian bipartite graphs
Applied Mathematics and Computation | 2005-02-23 | Paper |
Hyper Hamiltonian laceability on edge fault star graph
Information Sciences | 2005-02-09 | Paper |
scientific article; zbMATH DE number 2090664 (Why is no real title available?)
| 2004-08-12 | 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 |
Cycle embedding in faulty wrapped butterfly graphs
Networks | 2003-11-10 | 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 |
Optimal 1-edge fault-tolerant designs for ladders.
Information Processing Letters | 2003-01-21 | Paper |
A note on the ultimate categorical matching in a graph
Discrete Mathematics | 2002-12-02 | Paper |
Fault-tolerant Hamiltonicity of twisted cubes
Journal of Parallel and Distributed Computing | 2002-09-12 | Paper |
The correct diameter of trivalent Cayley graphs.
Information Processing Letters | 2002-07-25 | Paper |
The shuffle-cubes and their generalization
Information Processing Letters | 2002-07-25 | Paper |
Additive multiplicative increasing functions on nonnegative square matrices and multidigraphs
Discrete Mathematics | 2002-06-30 | Paper |
On the construction of combined \(k\)-fault-tolerant Hamiltonian graphs
Networks | 2001-12-12 | Paper |
Routing properties of supercubes
Information Sciences | 2001-07-29 | Paper |
Construction schemes for fault-tolerant Hamiltonian graphs
| 2000-07-09 | Paper |
Topological properties of twisted cube
Information Sciences | 2000-01-04 | Paper |
scientific article; zbMATH DE number 1222841 (Why is no real title available?)
| 1999-03-17 | Paper |
The Recognition of Double Euler Trails in Series-Parallel Networks
Journal of Algorithms | 1998-10-06 | Paper |
Element perturbation problems of optimum spanning trees with two-parameter objectives
Information Processing Letters | 1997-02-28 | Paper |
On minimal cost-reliability ratio spanning trees and related problems
Operations Research Letters | 1997-01-07 | Paper |
scientific article; zbMATH DE number 913351 (Why is no real title available?)
| 1996-11-25 | Paper |
scientific article; zbMATH DE number 870135 (Why is no real title available?)
| 1996-08-13 | Paper |
A response to Volgenant's Addendum on the most vital edges
| 1996-08-05 | Paper |
A note on the minimum cut cover of graphs
Operations Research Letters | 1995-07-13 | Paper |
The most vital edges of matching in a bipartite graph
Networks | 1993-08-23 | Paper |
Parallel algorithms for finding the most vital edge with respect to minimum spanning tree
Parallel Computing | 1993-01-17 | Paper |
The most vital edges with respect to the number of spanning trees in two- terminal series-parallel graphs
BIT | 1993-01-16 | Paper |
Finding the most vital edge with respect to minimum spanning tree in weighted graphs
Information Processing Letters | 1992-06-28 | Paper |
scientific article; zbMATH DE number 25546 (Why is no real title available?)
| 1992-06-27 | Paper |
Maximum independent number for series-parallel networks
Networks | 1992-06-25 | Paper |
Generalized homomorphism graph functions
Discrete Mathematics | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4127270 (Why is no real title available?)
| 1989-01-01 | Paper |
scientific article; zbMATH DE number 4118412 (Why is no real title available?)
| 1989-01-01 | Paper |
scientific article; zbMATH DE number 3968631 (Why is no real title available?)
| 1985-01-01 | Paper |
Dependence of tree copy functions
Discrete Mathematics | 1985-01-01 | Paper |
On a multiplicative graph function conjecture
Discrete Mathematics | 1983-01-01 | Paper |
