| A Spectral Version Of Mantel'S Theorem | 0 | 0.34 | 2022 |
| On the eigenvalues of Aα-matrix of graphs. | 0 | 0.34 | 2020 |
| Unimodality of Principal Eigenvector and its Applications. | 0 | 0.34 | 2020 |
| The algebraic connectivity of graphs with given circumference. | 0 | 0.34 | 2019 |
| The complements of path and cycle are determined by their distance (signless) Laplacian spectra. | 0 | 0.34 | 2018 |
| Nordhaus–Gaddum type result for the matching number of a graph | 0 | 0.34 | 2017 |
| Minimizing the least eigenvalue of bicyclic graphs with fixed diameter. | 0 | 0.34 | 2016 |
| Maximum size of digraphs with some parameters | 0 | 0.34 | 2016 |
| Some Relations Between the Eigenvalues of Adjacency, Laplacian and Signless Laplacian Matrix of a Graph | 0 | 0.34 | 2015 |
| Corrigendum to “The distance spectral radius of digraphs”: [Discrete Appl. Math. 161 (2013) 2537–2543] | 0 | 0.34 | 2015 |
| The extremal primitive digraph with both Lewin index n-2 and girth 2 or 3. | 0 | 0.34 | 2014 |
| Graphs with small second largest Laplacian eigenvalue | 0 | 0.34 | 2014 |
| The distance spectral radius of digraphs | 3 | 0.76 | 2013 |
| Distance spectral spread of a graph | 2 | 0.53 | 2012 |
| Flows and parity subgraphs of graphs with large odd-edge-connectivity | 1 | 0.38 | 2012 |
| On the matching polynomial of theta graphs. | 0 | 0.34 | 2012 |
| Minimizing the least eigenvalue of bicyclic graphs with k pendant vertices. | 0 | 0.34 | 2012 |
| Clique number and distance spectral radii of graphs. | 3 | 0.81 | 2012 |
| Some graft transformations and its applications on the distance spectral radius of a graph. | 4 | 0.78 | 2012 |
| The Minimal Limit Point of the Third Largest Laplacian Eigenvalues of Graphs. | 0 | 0.34 | 2012 |
| Bases of primitive nonpowerful sign patterns | 1 | 0.41 | 2012 |
| Distance spectral radius of digraphs with given connectivity | 4 | 0.65 | 2012 |
| Spectral radius of strongly connected digraphs. | 4 | 0.86 | 2012 |
| The base of a primitive, nonpowerful sign pattern with exactly d nonzero diagonal entries | 1 | 0.41 | 2011 |
| On the (Laplacian) spectral radius of bipartite graphs with given number of blocks. | 0 | 0.34 | 2011 |
| On the spectra of tricyclic graphs. | 0 | 0.34 | 2011 |
| Some graft transformations and its application on a distance spectrum | 10 | 1.63 | 2011 |
| Outerplanarity of line graphs and iterated line graphs | 0 | 0.34 | 2011 |
| Laplacian spectrum characterization of extensions of vertices of wheel graphs and multi-fan graphs | 2 | 0.45 | 2010 |
| Cyclability in k-connected K1,4-free graphs | 1 | 0.37 | 2010 |
| A lower bound for off-diagonal van der Waerden numbers | 0 | 0.34 | 2010 |
| The Laplacian spectral radius of bicyclic graphs with a given girth | 0 | 0.34 | 2010 |
| Minimizing the least eigenvalue of unicyclic graphs with fixed diameter | 4 | 0.55 | 2010 |
| The spread of the unicyclic graphs | 4 | 0.41 | 2010 |
| The minimal Laplacian spectral radius of trees with a given diameter | 0 | 0.34 | 2009 |
| A sufficient condition for cyclability in directed graphs | 1 | 0.39 | 2007 |
| A note about shortest cycle covers | 1 | 0.38 | 2005 |
| The partition of a strong tournament | 9 | 1.05 | 2005 |
| Nowhere-zero 3-flows in products of graphs | 8 | 0.87 | 2005 |
| Partitioning A Strong Tournament Into K Cycles | 2 | 0.43 | 2004 |
| On the Laplacian spread of graphs | 3 | 0.52 | 2004 |
| A sharp upper bound of the spectral radius of graphs | 21 | 3.15 | 2001 |
| A sharp upper bound for the spectral radius of the Nordhaus-Gaddum type | 10 | 1.39 | 2000 |
