| Publication | Date of Publication | Type |
|---|
The g-good-neighbor diagnosability of lexicographic product networks under the pmc model
Theoretical Computer Science | 2026-04-16 | Paper |
Non-inclusive g-extra diagnosability of interconnection networks under MM* model
Discrete Applied Mathematics | 2026-02-24 | Paper |
The lower bounds of 4-tree connectivity of Cartesian product graphs
Discrete Applied Mathematics | 2026-02-11 | Paper |
Reliability analysis of the quinary n-cube networks with non-lexicographic order optimal solution of the edge isoperimetric problem
Theoretical Computer Science | 2026-02-04 | Paper |
Constructing disjoint Steiner trees in Sierpiński graphs
Fundamenta Informaticae | 2025-10-06 | Paper |
Higher order matching preclusion for regular interconnection networks
Discrete Applied Mathematics | 2025-06-30 | Paper |
The cyclic diagnosability of Cayley graphs generated by transposition trees
Discrete Applied Mathematics | 2025-06-19 | Paper |
The distance-edge-monitoring numbers of subdivision graphs
Discrete Applied Mathematics | 2025-06-19 | Paper |
Conditional fractional matching preclusion number of graphs
International Journal of Foundations of Computer Science | 2025-03-11 | Paper |
A short note on the large Steiner k-diameter of graphs
Congressus Numerantium | 2025-01-08 | Paper |
Realizability problem of distance-edge-monitoring numbers
RAIRO. Operations Research | 2025-01-08 | Paper |
Disjoint and shortest paths routing in hypercubes
Congressus Numerantium | 2025-01-02 | Paper |
Non-inclusive g-extra diagnosability of interconnection networks under PMC model
Theoretical Computer Science | 2024-12-02 | Paper |
| Structural properties of \(m\)-ary \(n\)-dimensional hypercubes | 2024-10-09 | Paper |
Reliability analysis of exchanged hypercubes based on the path connectivity
Discrete Applied Mathematics | 2024-09-26 | Paper |
A note on the conditional fault-tolerant strong Menger edge connectivity of regular graphs
Discrete Applied Mathematics | 2024-03-27 | Paper |
| Ascending Ramsey sequences in graphs | 2024-02-26 | Paper |
| Constructing disjoint Steiner trees in Sierpi\'{n}ski graphs | 2023-10-25 | Paper |
On the \(g\)-extra connectivity of augmented cubes
Theoretical Computer Science | 2023-08-08 | Paper |
| Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs (extended abstract) | 2023-03-30 | Paper |
Component connectivity of augmented cubes
Theoretical Computer Science | 2023-03-24 | Paper |
A lower bound for the 3-pendant tree-connectivity of lexicographic product graphs
Czechoslovak Mathematical Journal | 2023-02-21 | Paper |
Restricted connectivity of Cayley graph generated by transposition trees
Discrete Applied Mathematics | 2023-01-11 | Paper |
Reliability analysis of the generalized balanced hypercube
Theoretical Computer Science | 2022-12-21 | Paper |
Fault diagnosability of regular graphs
Theory and Applications of Graphs | 2022-12-15 | Paper |
| On the extraconnectivity of arrangement graphs | 2022-10-22 | Paper |
Characterization of component diagnosability of regular networks
Discrete Applied Mathematics | 2022-10-13 | Paper |
Separation problems for the stable set polytope
Integer Programming and Combinatorial Optimization | 2022-08-30 | Paper |
A brief account on the development and future research directions of connectivity properties of interconnection networks
Parallel Processing Letters | 2022-07-08 | Paper |
Structure and Substructure Connectivity of Hypercube-Like Networks
Parallel Processing Letters | 2022-07-08 | Paper |
Matching Preclusion for the Shuffle-Cubes
Parallel Processing Letters | 2022-07-08 | Paper |
Reliability evaluation of bicube-based multiprocessor system under the g-good-neighbor restriction
Parallel Processing Letters | 2022-07-08 | Paper |
Fractional matching preclusion for (n,k)-star graphs
Parallel Processing Letters | 2022-07-04 | Paper |
A note on the Steiner k-diameter of tensor product networks
Parallel Processing Letters | 2022-07-04 | Paper |
Proper coloring distance in edge-colored Cartesian products of complete graphs and cycles
Parallel Processing Letters | 2022-07-04 | Paper |
On the g-extra diagnosability of enhanced hypercubes
Theoretical Computer Science | 2022-05-23 | Paper |
| A general approach to deriving diagnosability results of interconnection networks | 2022-04-06 | Paper |
Fractional matching preclusion number of graphs
Discrete Applied Mathematics | 2022-03-04 | Paper |
Fault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networks
Theoretical Computer Science | 2022-02-21 | Paper |
A note on maximum fractional matchings of graphs
Journal of Combinatorial Optimization | 2022-02-14 | Paper |
Linear k-arboricity of Caylay graphs on abelian groups with given degree
Mathematics in Computer Science | 2022-01-28 | Paper |
Reliability analysis of the cactus-based networks
Theoretical Computer Science | 2021-09-27 | Paper |
| The conditional strong matching preclusion of augmented cubes | 2021-04-28 | Paper |
A note on the strong matching preclusion problem for data center networks
Information Processing Letters | 2020-10-07 | Paper |
2-spanning cyclability problems of some generalized Petersen graphs
Discussiones Mathematicae Graph Theory | 2020-04-28 | Paper |
Conditional strong matching preclusion of the alternating group graph
Theory and Applications of Graphs | 2020-02-03 | Paper |
Fractional matching preclusion for generalized augmented cubes
(available as arXiv preprint) | 2020-01-13 | Paper |
| Fractional matching preclusion for generalized augmented cubes | 2020-01-13 | Paper |
Matching preclusion of the generalized Petersen graph
Theory and Applications of Graphs | 2019-12-13 | Paper |
Minimum degree and size conditions for the proper connection number of graphs
Applied Mathematics and Computation | 2019-11-27 | Paper |
Strongly Menger connectedness of data center network and \((n,k)\)-star graph
Theoretical Computer Science | 2019-11-13 | Paper |
Fractional matching preclusion for arrangement graphs
Discrete Applied Mathematics | 2019-11-06 | Paper |
The \(k\)-independence number of graph products
The Art of Discrete and Applied Mathematics | 2019-10-02 | Paper |
Fault-Hamiltonicity of Cartesian products of directed cycles
The Art of Discrete and Applied Mathematics | 2019-10-02 | Paper |
A note on generalized matching preclusion in bipartite graphs
Theoretical Computer Science | 2019-09-10 | Paper |
| scientific article; zbMATH DE number 7084989 (Why is no real title available?) | 2019-07-24 | Paper |
| Matching preclusion of boxdot products | 2019-07-24 | Paper |
| On coloring complete binary trees | 2019-07-24 | Paper |
| A proposed scheme of findings closed form solutions to surface areas of graphs | 2019-07-24 | Paper |
Generalized Matching Preclusion in Bipartite Graphs
Theory and Applications of Graphs | 2019-07-22 | Paper |
Proper distance in edge-colored hypercubes
Applied Mathematics and Computation | 2019-04-29 | Paper |
Two kinds of generalized connectivity of dual cubes
Discrete Applied Mathematics | 2019-03-11 | Paper |
Matching preclusion number in product graphs
Theoretical Computer Science | 2019-02-14 | Paper |
Matching preclusion number of graphs
Theoretical Computer Science | 2019-01-18 | Paper |
A general approach to deriving the \(g\)-good-neighbor conditional diagnosability of interconnection networks
Theoretical Computer Science | 2019-01-18 | Paper |
Steiner distance in product networks
(available as arXiv preprint) | 2018-12-10 | Paper |
| Steiner distance in product networks | 2018-12-10 | Paper |
Structural properties of generalized exchanged hypercubes
Emergent Computation | 2018-10-04 | Paper |
Strongly Menger-edge-connectedness and strongly Menger-vertex-connectedness of regular networks
Theoretical Computer Science | 2018-06-07 | Paper |
Length two path centered surface areas of the \((n, k)\)-star graph
Information Sciences | 2018-05-22 | Paper |
| Strong matching preclusion of the generalized Petersen graph | 2018-04-23 | Paper |
A complete classification of which (n,k)-star graphs are Cayley graphs
Graphs and Combinatorics | 2018-03-22 | Paper |
Strong matching preclusion number of graphs
Theoretical Computer Science | 2018-02-06 | Paper |
Strong fault-Hamiltonicity for the crossed cube and its extensions
Parallel Processing Letters | 2017-12-15 | Paper |
On the conditional diagnosability of hyper-buttery graphs and related networks
Parallel Processing Letters | 2017-12-15 | Paper |
Linearly Many Edge-Faults in 2-Bijective Connection Networks
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 |
On the problem of determining which \((n, k)\)-star graphs are Cayley graphs
Graphs and Combinatorics | 2017-06-29 | Paper |
| A note on the conditional matching preclusion problem of the folded Petersen cube | 2017-04-04 | Paper |
A strong connectivity property of the generalized exchanged hypercube
Discrete Applied Mathematics | 2017-03-15 | Paper |
| The Steiner (n-3)-diameter of a graph | 2017-03-11 | Paper |
On the conditional diagnosability of matching composition networks
Theoretical Computer Science | 2016-06-27 | Paper |
On the Day-Tripathi orientation of the star graphs: connectivity
Information Processing Letters | 2016-06-16 | Paper |
On the cyclability of graphs
JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing | 2016-05-30 | Paper |
Conditional matching preclusion for the star graphs.
Ars Combinatoria | 2016-05-04 | Paper |
Strong matching preclusion of 2-matching composition networks
Congressus Numerantium | 2016-04-13 | Paper |
Edge centered surface area for the (n, k)-star graph
JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing | 2016-03-16 | Paper |
Strong matching preclusion of (n,k)-star graphs
Theoretical Computer Science | 2016-01-21 | Paper |
Diagnosability of Cayley graphs generated by transposition trees with missing edges
Information Sciences | 2015-09-23 | Paper |
The number of shortest paths in the arrangement graph
Information Sciences | 2015-09-23 | Paper |
| On the surface areas of the alternating group graph and the split-star graph. | 2015-08-26 | Paper |
| A computer-aided examination of some classes of hypercube-like super fault-tolerant Hamiltonian networks | 2015-05-21 | Paper |
| Hamiltonian edge-connectivity of 2-tree-generated networks | 2015-05-21 | Paper |
| Structural properties of 2-bijective connection networks and 2-matching composition networks | 2015-05-21 | Paper |
On Hamiltonian properties of unidirectional hypercubes
Information Processing Letters | 2015-05-21 | Paper |
Matching preclusion and conditional matching preclusion problems for the folded Petersen cube
Theoretical Computer Science | 2015-05-18 | 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 number of shortest paths in the (n, k)-star graph
Discrete Mathematics, Algorithms and Applications | 2014-11-28 | Paper |
Length two path centered surface area for bipartite graphs
JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing | 2014-11-04 | Paper |
Length two path-centred surface areas for the arrangement graph
International Journal of Computer Mathematics | 2014-10-14 | Paper |
Strong local diagnosability of (n,k)-star graphs and Cayley graphs generated by 2-trees with missing edges
Information Processing Letters | 2014-08-13 | Paper |
The \(Q_{n,k,m}\) graph: a common generalization of various popular interconnection networks
Parallel Processing Letters | 2014-04-10 | Paper |
CONDITIONAL MATCHING PRECLUSION FOR (n,k)-STAR GRAPHS
Parallel Processing Letters | 2014-04-10 | Paper |
| Matching preclusion and conditional matching preclusion for dual-cubes | 2014-04-02 | Paper |
| A study of Kuramoto model synchronization in some popular interconnection networks | 2014-04-02 | Paper |
The edge-centered surface area of the arrangement graph
Journal of Combinatorial Optimization | 2014-02-25 | Paper |
Conditional matching preclusion for Cayley graphs generated by transposition trees
Congressus Numerantium | 2014-01-03 | Paper |
Cohesive labelings of graphs
Congressus Numerantium | 2014-01-03 | Paper |
Strong matching preclusion for augmented cubes
Theoretical Computer Science | 2013-12-17 | Paper |
Linearly many faults in arrangement graphs
Networks | 2013-08-06 | Paper |
Cyclic vertex-connectivity of Cayley graphs generated by transposition trees
Graphs and Combinatorics | 2013-07-19 | Paper |
Linearly many faults in dual-cube-like networks
Theoretical Computer Science | 2013-03-04 | Paper |
Matching preclusion and conditional matching preclusion for crossed cubes
Parallel Processing Letters | 2012-12-12 | Paper |
On the surface areas and average distances of meshes and tori
Parallel Processing Letters | 2012-12-12 | Paper |
The edge-centered surface area of the arrangement graph
Combinatorial Optimization and Applications | 2012-11-02 | Paper |
On deriving conditional diagnosability of interconnection networks
Information Processing Letters | 2012-10-23 | Paper |
Matching preclusion and conditional matching preclusion for bipartite interconnection networks. I: Sufficient conditions
Networks | 2012-09-21 | Paper |
Matching preclusion and conditional matching preclusion for bipartite interconnection networks. II: Cayley graphs generated by transposition trees and hyper-stars
Networks | 2012-09-21 | Paper |
Linearly many faults in (n,k)-star graphs
International Journal of Foundations of Computer Science | 2012-08-29 | Paper |
Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
Discrete Applied Mathematics | 2012-08-14 | Paper |
Matching preclusion and conditional matching preclusion for regular interconnection networks
Discrete Applied Mathematics | 2012-08-10 | Paper |
One-to-many node-disjoint paths of hyper-star networks
Discrete Applied Mathematics | 2012-08-10 | Paper |
Solution to an open problem on 4-ordered Hamiltonian graphs
Discrete Mathematics | 2012-08-10 | Paper |
A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees
Information Sciences | 2012-07-13 | Paper |
Component connectivity of the hypercubes
International Journal of Computer Mathematics | 2012-05-15 | Paper |
| Hamiltonian connectedness of the generalized Petersen graph GP(n,4) | 2012-01-26 | Paper |
| Matching preclusion and conditional matching preclusion problems for the generalized Petersen graph P(n,3) | 2012-01-26 | Paper |
Conditional matching preclusion for the arrangement graphs
Theoretical Computer Science | 2012-01-09 | Paper |
On the surface area of the asymmetric twisted cube
Combinatorial Optimization and Applications | 2011-08-12 | Paper |
On the edge-connectivity of graphs with two orbits of the same size
Discrete Mathematics | 2011-08-08 | Paper |
| scientific article; zbMATH DE number 5919743 (Why is no real title available?) | 2011-07-13 | Paper |
Independent spanning trees on even networks
Information Sciences | 2011-06-22 | Paper |
A note on embeddings among folded hypercubes, even graphs and odd graphs
International Journal of Computer Mathematics | 2011-04-21 | Paper |
Conditional matching preclusion for the alternating group graphs and Split-stars
International Journal of Computer Mathematics | 2011-04-21 | Paper |
On deriving explicit formulas of the surface areas for the arrangement graphs and some of the related graphs
International Journal of Computer Mathematics | 2011-01-20 | Paper |
The Number of Shortest Paths in the (n, k)-Star Graphs
Combinatorial Optimization and Applications | 2011-01-08 | Paper |
Fault resiliency of Cayley graphs generated by transpositions
International Journal of Foundations of Computer Science | 2011-01-06 | Paper |
Linearly many faults in 2-tree-generated networks
Networks | 2010-11-24 | Paper |
Matching preclusion for the (<i>n, k</i>)-bubble-sort graphs
International Journal of Computer Mathematics | 2010-11-12 | Paper |
A short note on the surface area of star graphs
Parallel Processing Letters | 2010-09-29 | Paper |
| A kind of conditional vertex connectivity of Cayley graphs generated by transposition trees | 2010-09-02 | Paper |
Distance formula and shortest paths for the \((n,k)\)-star graphs
Information Sciences | 2010-06-11 | Paper |
On the surface area of the (n,k)-star graph
Theoretical Computer Science | 2009-11-25 | Paper |
On Disjoint Shortest Paths Routing on the Hypercube
Combinatorial Optimization and Applications | 2009-07-07 | Paper |
Embedding hypercubes, rings, and odd graphs into hyper-stars
International Journal of Computer Mathematics | 2009-05-29 | Paper |
| A tree labeling problem | 2009-03-26 | Paper |
Conditional matching preclusion sets
Information Sciences | 2009-03-25 | Paper |
| The (n,k)-bubble sort graphs | 2009-03-24 | Paper |
Hamiltonian connectivity of 2-tree-generated networks
Mathematical and Computer Modelling | 2009-03-23 | Paper |
Strong structural properties of unidirectional star graphs
Discrete Applied Mathematics | 2009-03-09 | Paper |
MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
International Journal of Foundations of Computer Science | 2009-02-26 | Paper |
On the Surface Area of the (n, k)-Star Graph
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
Orienting Cayley graphs generated by transposition trees
Computers & Mathematics with Applications | 2008-09-11 | Paper |
| scientific article; zbMATH DE number 5237247 (Why is no real title available?) | 2008-02-20 | Paper |
Linearly many faults in Cayley graphs generated by transposition trees
Information Sciences | 2007-10-18 | Paper |
Matching preclusion for some interconnection networks
Networks | 2007-09-21 | Paper |
| scientific article; zbMATH DE number 5139492 (Why is no real title available?) | 2007-04-02 | Paper |
| Structural properties of hyper-stars. | 2007-03-29 | Paper |
| A disjoint path problem in the alternating group graph | 2006-03-30 | Paper |
Maximal vertex-connectivity of
Networks | 2006-01-23 | Paper |
| scientific article; zbMATH DE number 2230272 (Why is no real title available?) | 2005-11-18 | Paper |
| scientific article; zbMATH DE number 2230273 (Why is no real title available?) | 2005-11-18 | Paper |
| scientific article; zbMATH DE number 2230274 (Why is no real title available?) | 2005-11-18 | Paper |
| scientific article; zbMATH DE number 2187684 (Why is no real title available?) | 2005-07-20 | Paper |
| scientific article; zbMATH DE number 2170482 (Why is no real title available?) | 2005-05-23 | Paper |
| scientific article; zbMATH DE number 2170426 (Why is no real title available?) | 2005-05-23 | Paper |
| scientific article; zbMATH DE number 2077661 (Why is no real title available?) | 2004-07-01 | Paper |
| scientific article; zbMATH DE number 2068173 (Why is no real title available?) | 2004-05-27 | Paper |
Separating multi-oddity constrained shortest circuits over the polytope of stable multisets.
Operations Research Letters | 2004-01-05 | Paper |
| scientific article; zbMATH DE number 1990698 (Why is no real title available?) | 2003-10-13 | Paper |
Time-stamped graphs and their associated influence digraphs
Discrete Applied Mathematics | 2003-06-10 | Paper |
On the Facet-Inducing Antiweb-Wheel Inequalities for Stable Set Polytopes
SIAM Journal on Discrete Mathematics | 2003-01-05 | Paper |
Increasing the connectivity of the star graphs
Networks | 2002-12-17 | Paper |
| scientific article; zbMATH DE number 1735804 (Why is no real title available?) | 2002-10-24 | Paper |
| scientific article; zbMATH DE number 1743821 (Why is no real title available?) | 2002-10-10 | Paper |
Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness
Discrete Applied Mathematics | 2002-06-24 | Paper |
Antiweb-wheel inequalities and their separation problems over the stable set polytopes
Mathematical Programming. Series A. Series B | 2002-06-12 | Paper |
| scientific article; zbMATH DE number 1933262 (Why is no real title available?) | 2002-01-01 | Paper |
Orienting the arrangement graphs
Congressus Numerantium | 2001-11-22 | Paper |
Increasing the connectivity of split-stars
Congressus Numerantium | 2001-10-21 | Paper |
Separating subdivision of bicycle wheel inequalities over cut polytopes
Operations Research Letters | 2001-02-09 | Paper |
Successive edge-connectivity augmentation problems
Mathematical Programming. Series A. Series B | 2000-07-10 | Paper |
| scientific article; zbMATH DE number 1444282 (Why is no real title available?) | 2000-05-09 | Paper |
| scientific article; zbMATH DE number 1439419 (Why is no real title available?) | 2000-05-07 | Paper |
| scientific article; zbMATH DE number 1439471 (Why is no real title available?) | 2000-05-07 | Paper |
Edge-augmentation of hypergraphs
Mathematical Programming. Series A. Series B | 2000-02-27 | Paper |
Wheel inequalities for stable set polytopes
Mathematical Programming. Series A. Series B | 1997-11-25 | Paper |
A faster algorithm for computing the strength of a network
Information Processing Letters | 1994-04-05 | Paper |
