2022
Note on reliability evaluation of arrangement graphs.
Appl. Math. Comput., 2022
2019
On conditional fault tolerance of hierarchical cubic networks.
Theor. Comput. Sci., 2019
Generalized measures of fault tolerance for bubble sort networks.
Appl. Math. Comput., 2019
2017
The vulnerability of the diameter of the enhanced hypercubes.
Theor. Comput. Sci., 2017
On fault tolerance of (n, k)-star networks.
Theor. Comput. Sci., 2017
Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs.
Theor. Comput. Sci., 2017
On Seymour's Second Neighborhood conjecture of m-free digraphs.
Discret. Math., 2017
Many-to-many disjoint paths in hypercubes with faulty vertices.
Discret. Appl. Math., 2017
Graham's pebbling conjecture on the middle graphs of even cycles.
Ars Comb., 2017
2016
Embedded connectivity of recursive networks.
Theor. Comput. Sci., 2016
Relationship between conditional diagnosability and 2-extra connectivity of symmetric graphs.
Theor. Comput. Sci., 2016
Pebbling numbers of the Cartesian product of cycles and graphs.
Australas. J Comb., 2016
2015
On the p-reinforcement and the complexity.
J. Comb. Optim., 2015
On the (l, ω)-domination number of the cube network.
Ars Comb., 2015
The bondage number of (n-3)-regular graphs of order n.
Ars Comb., 2015
2014
Vulnerability of super edge-connected networks.
Theor. Comput. Sci., 2014
Generalized measures for fault tolerance of star networks.
Networks, 2014
Total and paired domination numbers of toroidal meshes.
J. Comb. Optim., 2014
The p-domination number of complete multipartite graphs.
Discret. Math. Algorithms Appl., 2014
Trees with maximum p-reinforcement number.
Discret. Appl. Math., 2014
Fault-tolerance of (n, k)-star networks.
Appl. Math. Comput., 2014
Roman bondage numbers of some graphs.
Australas. J Comb., 2014
2013
Fault diagnosability of arrangement graphs.
Inf. Sci., 2013
Minimum feedback arc set of m-free digraphs.
Inf. Process. Lett., 2013
Edge-fault tolerance of hypercube-like networks.
Inf. Process. Lett., 2013
Generalized measures of fault tolerance in exchanged hypercubes.
Inf. Process. Lett., 2013
The Signed Edge-Domatic Number of a Graph.
Graphs Comb., 2013
On the Roman bondage Number of a Graph.
Discret. Math. Algorithms Appl., 2013
Connectivity of lexicographic product and direct product of graphs.
Ars Comb., 2013
The Bondage Number of Graphs with Crossing Number Less than Four.
Ars Comb., 2013
2012
On the complexity of the bondage and reinforcement problems.
J. Complex., 2012
On the bounds of feedback numbers of (n, k)-star graphs.
Inf. Process. Lett., 2012
Conditional Fault Diagnosability of Dual-Cubes.
Int. J. Found. Comput. Sci., 2012
Conditional fault diagnosis of hierarchical hypercubes.
Int. J. Comput. Math., 2012
The total bondage number of grid graphs.
Discret. Appl. Math., 2012
Conditional Fault Diagnosis of Bubble Sort Graphs under the PMC Model
CoRR, 2012
The Forwarding Indices of Graphs -- a Survey
CoRR, 2012
Feedback numbers of Kautz undirected graphs.
Australas. J Comb., 2012
2011
Panconnectivity of Cartesian product graphs.
J. Supercomput., 2011
Fault-tolerant edge-pancyclicity of locally twisted cubes.
Inf. Sci., 2011
Conditional fault tolerance of arrangement graphs.
Inf. Process. Lett., 2011
A note on cycle embedding in hypercubes with faulty vertices.
Inf. Process. Lett., 2011
The <i>p</i>-Bondage Number of Trees.
Graphs Comb., 2011
Complexity of Bondage and Reinforcement
CoRR, 2011
Highly Fault-Tolerant Routings in Some Cartesian Product Digraphs.
Ars Comb., 2011
The Menger number of the Cartesian product of graphs.
Appl. Math. Lett., 2011
2010
On the (2, 2)-domination number of trees.
Discuss. Math. Graph Theory, 2010
A characterization of <i>(γ<sub>t</sub>, γ<sub>2</sub>)</i>-trees.
Discuss. Math. Graph Theory, 2010
A new class of transitive graphs.
Discret. Math., 2010
Feedback numbers of de Bruijn digraphs.
Comput. Math. Appl., 2010
Connectivity and super-connectivity of Cartesian product graphs.
Ars Comb., 2010
On Super and Restricted Connectivity of Some Interconnection Networks.
Ars Comb., 2010
Algebraic Properties and Panconnectivity of Folded Hypercubes.
Ars Comb., 2010
Domination and Total Domination Contraction Numbers of Graphs.
Ars Comb., 2010
Bipanconnectivity of Cartesian product networks.
Australas. J Comb., 2010
2009
Probabilistic analysis of upper bounds for 2-connected distance k-dominating sets in graphs.
Theor. Comput. Sci., 2009
The forwarding indices of wrapped butterfly networks.
Networks, 2009
Edge-fault-tolerant bipanconnectivity of hypercubes.
Inf. Sci., 2009
A note on "The super connectivity of augmented cubes".
Inf. Process. Lett., 2009
Diameter vulnerability of graphs by edge deletion.
Discret. Math., 2009
Forwarding index of cube-connected cycles.
Discret. Appl. Math., 2009
Average distances and distance domination numbers.
Discret. Appl. Math., 2009
Bounded edge-connectivity and edge-persistence of Cartesian product of graphs.
Discret. Appl. Math., 2009
Reinforcement numbers of digraphs.
Discret. Appl. Math., 2009
On (a, d)-Antimagic Labelings of Generalized Petersen Graphs.
Ars Comb., 2009
A note on distance domination numbers of graphs.
Australas. J Comb., 2009
2008
Fault-tolerant embedding of paths in crossed cubes.
Theor. Comput. Sci., 2008
Reliability of interconnection networks modeled by Cartesian product digraphs.
Networks, 2008
The super connectivity of augmented cubes.
Inf. Process. Lett., 2008
The bondage numbers and efficient dominations of vertex-transitive graphs.
Discret. Math., 2008
Restricted Edge-Connectivity of de Bruijn Digraphs.
Ars Comb., 2008
Weakly Edge-Pancyclicity of Locally Twisted Cubes.
Ars Comb., 2008
Distance domination-critical graphs.
Appl. Math. Lett., 2008
2007
Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes.
Parallel Comput., 2007
On super edge-connectivity of Cartesian product graphs.
Networks, 2007
On reliability of the folded hypercubes.
Inf. Sci., 2007
Fault-tolerant analysis of a class of networks.
Inf. Process. Lett., 2007
Fault diameter of product graphs.
Inf. Process. Lett., 2007
The forwarding indices of augmented cubes.
Inf. Process. Lett., 2007
Fault-tolerant pancyclicity of augmented cubes.
Inf. Process. Lett., 2007
Feedback numbers of Kautz digraphs.
Discret. Math., 2007
The bondage numbers of graphs with small crossing numbers.
Discret. Math., 2007
The total domination and total bondage numbers of extended de Bruijn and Kautz digraphs.
Comput. Math. Appl., 2007
A New Upper Bound On Forwarding Index of Graphs.
Ars Comb., 2007
The Restricted Edge-Connectivity of de Bruijn Undirected Graphs.
Ars Comb., 2007
On Distance Connected Domination Numbers of Graphs.
Ars Comb., 2007
Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes.
Appl. Math. Comput., 2007
2006
Paths in Möbius cubes and crossed cubes.
Inf. Process. Lett., 2006
Connectivity of Cartesian product graphs.
Discret. Math., 2006
Distance irredundance and connected domination numbers of a graph.
Discret. Math., 2006
The bondage numbers of extended de Bruijn and Kautz digraphs.
Comput. Math. Appl., 2006
The Restricted Edge-Connectivity of Kautz Undirected Graphs.
Ars Comb., 2006
Cycles in folded hypercubes.
Appl. Math. Lett., 2006
Panconnectivity of locally twisted cubes.
Appl. Math. Lett., 2006
Edge fault tolerance analysis of a class of interconnection networks.
Appl. Math. Comput., 2006
Edge-fault-tolerant properties of hypercubes and folded hypercubes.
Australas. J Comb., 2006
2005
Wide Diameter of Möbius Cubes.
J. Interconnect. Networks, 2005
The super connectivity of shuffle-cubes.
Inf. Process. Lett., 2005
Fault diameter of Cartesian product graphs.
Inf. Process. Lett., 2005
Edge-pancyclicity of Möbius cubes.
Inf. Process. Lett., 2005
Super connectivity of line graphs.
Inf. Process. Lett., 2005
Edge-fault-tolerant edge-bipancyclicity of hypercubes.
Inf. Process. Lett., 2005
Forwarding indices of folded <i>n</i>-cubes.
Discret. Appl. Math., 2005
2004
The proof of a conjecture of Bouabdallah and Sotteau.
Networks, 2004
Wide Diameters of Cartesian Product Graphs and Digraphs.
J. Comb. Optim., 2004
2-restricted edge connectivity of vertex-transitive graphs.
Australas. J Comb., 2004
2002
On restricted edge-connectivity of graphs.
Discret. Math., 2002
1996
2-diameter of de Bruijn graphs.
Networks, 1996
1994
A sufficient condition for equality of arc-connectivity and minimum degree of a diagraph.
Discret. Math., 1994
1993
A very short proof of a conjecture concerning set-to-set broadcasting.
Networks, 1993
The Infinite Families of Optimal Double Loop Networks.
Discret. Appl. Math., 1993
1990
A combinatorial problem related to distributed loop networks.
Networks, 1990
