| Publication | Date of Publication | Type |
|---|
Topological indices and disjoint path cover property of graphs
Iranian Journal of Mathematical Chemistry | 2026-09-21 | Paper |
Subnetwork reliability analysis of generalized hypercube networks
Discrete Applied Mathematics | 2026-09-18 | Paper |
Structure fault diameter of hypercubes
Fundamenta Informaticae | 2026-08-27 | Paper |
Many-to-many two-disjoint path covers in Cayley graphs generated by unicyclic graphs
Discrete Applied Mathematics | 2026-07-28 | Paper |
Extremal sizes of spanning connected graphs
Discrete Applied Mathematics | 2026-04-17 | Paper |
On the diameter of hypercubes with star structure faults
Discrete Applied Mathematics | 2025-12-16 | Paper |
Robustness of reliability bounds for ( n, k )-star networks
Discrete Applied Mathematics | 2025-09-17 | Paper |
Further combinatorial analysis of substar reliability in star networks
Journal of Combinatorial Optimization | 2025-05-31 | Paper |
On spanning laceability of bipartite graphs
Applied Mathematics and Computation | 2025-04-24 | Paper |
Super spanning connectivity of the generalized hypercube network
Theoretical Computer Science | 2025-02-03 | Paper |
On spanning wide diameter of spider web networks
Parallel Processing Letters | 2025-01-03 | Paper |
The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree
Discrete Applied Mathematics | 2024-08-09 | Paper |
Structure fault diameter of hypercubes
(available as arXiv preprint) | 2024-01-01 | Paper |
Component connectivity of the data center network dcell
Applied Mathematics and Computation | 2023-04-21 | Paper |
Degree sequence conditions for a graph to be disjoint path coverable
Discrete Applied Mathematics | 2023-04-17 | Paper |
The spanning cyclability of Cayley graphs generated by transposition trees
Discrete Applied Mathematics | 2023-02-22 | Paper |
Embedding spanning disjoint cycles in enhanced hypercube networks with prescribed vertices in each cycle
Applied Mathematics and Computation | 2022-09-21 | Paper |
The antistrong property for special digraph families
Graphs and Combinatorics | 2021-11-30 | Paper |
Generalizations of the classics to spanning connectedness
Applied Mathematics and Computation | 2021-11-10 | Paper |
Fault-tolerant Hamiltonicity of hypercubes with faulty subcubes
Information Processing Letters | 2021-10-19 | Paper |
Sufficient conditions for graphs to be spanning connected
Applied Mathematics and Computation | 2020-05-07 | Paper |
Characterizations of optimal component cuts of locally twisted cubes
Bulletin of the Malaysian Mathematical Sciences Society. Second Series | 2020-04-23 | Paper |
The extra connectivity of the enhanced hypercubes
Theoretical Computer Science | 2019-11-13 | Paper |
Conditional edge connectivity of the locally twisted cubes
Journal of the Operations Research Society of China | 2019-10-04 | Paper |
Parallel routing in regular networks with faults
Information Processing Letters | 2018-12-05 | Paper |
Structure fault tolerance of hypercubes and folded hypercubes
Theoretical Computer Science | 2018-02-16 | Paper |
Spanning connectivity of the power of a graph and Hamilton-connected index of a graph
Graphs and Combinatorics | 2015-01-20 | Paper |
