| Publication | Date of Publication | Type |
|---|
Characterization of the structure of k-edge-maximal graphs
(available as arXiv preprint) | 2026-01-01 | Paper |
Sharp upper bounds on the A_α-spectral radius of graphs
(available as arXiv preprint) | 2026-01-01 | Paper |
A proof of the resistance diameter conjecture for line graphs
(available as arXiv preprint) | 2026-01-01 | Paper |
Graph Sensitivity of Cartesian Products with Matched Bridges
(available as arXiv preprint) | 2026-01-01 | Paper |
Resolving a Problem of Lv and Koolen on the Smallest Eigenvalue of Distance-Regular Graphs
(available as arXiv preprint) | 2026-01-01 | Paper |
On injective chromatic index of sparse graphs with maximum degree 5
Journal of Combinatorial Optimization | 2025-02-06 | Paper |
Induced subgraphs of product graphs and a generalization of Huang's theorem
Journal of Graph Theory | 2023-10-04 | Paper |
Fractional arboricity, strength and eigenvalues of graphs with fixed girth or clique number
Linear Algebra and its Applications | 2021-02-17 | Paper |
Connectivity and eigenvalues of graphs with given girth or clique number
Linear Algebra and its Applications | 2021-02-12 | Paper |
Connectivity and eigenvalues of graphs with given girth or clique number
(available as arXiv preprint) | 2020-01-01 | Paper |
Maximum Detour-Harary index for some graph classes
Symmetry | 2019-11-13 | Paper |
Vertex-connectivity and eigenvalues of graphs
Linear Algebra and its Applications | 2019-09-10 | Paper |
| A note on the optimal rubbling in ladders and prisms | 2019-09-04 | Paper |
| Sufficient conditions for digraphs to be maximally connected and super-connected | 2019-06-21 | Paper |
| Generalization of the cover pebbling number on trees | 2019-03-12 | Paper |
Generalization of the cover pebbling number on trees
(available as arXiv preprint) | 2019-01-01 | Paper |
A note on the optimal rubbling in ladders and prisms
(available as arXiv preprint) | 2019-01-01 | Paper |
On restricted edge-connectivity of replacement product graphs
Science China. Mathematics | 2018-04-04 | Paper |
| scientific article; zbMATH DE number 6837056 (Why is no real title available?) | 2018-02-09 | Paper |
| Sufficient conditions for maximally edge-connected and super-edge-connected graphs | 2017-12-20 | Paper |
| Sufficient conditions for graphs to be $k$-connected, maximally connected and super-connected | 2017-08-17 | Paper |
| Pebbling on Jahangir graphs | 2017-04-29 | Paper |
Pebbling on Jahangir graphs
(available as arXiv preprint) | 2017-01-01 | Paper |
Sufficient conditions for graphs to be k-connected, maximally connected and super-connected
(available as arXiv preprint) | 2017-01-01 | Paper |
The signless Laplacian or adjacency spectral radius of bicyclic graphs with given number of cut edges
Graphs and Combinatorics | 2015-09-24 | Paper |
Parity subgraphs with few common edges and nowhere-zero 5-flow
Graphs and Combinatorics | 2015-09-24 | Paper |
| Edge fault-tolerance of super restricted edge-connected Cartesian product graphs | 2015-06-29 | Paper |
Vulnerability of super edge-connected networks
Theoretical Computer Science | 2014-01-13 | Paper |
| On the least eigenvalue of graphs with matching number two | 2012-01-27 | Paper |
