| Publication | Date of Publication | Type |
|---|
| On the distribution of eigenvalues of graphs | 2024-01-29 | Paper |
| Explicit solutions of the Yang-Baxter-like matrix equation for a diagonalizable matrix with spectrum contained in \(\{1, \alpha , 0\}\) | 2019-11-26 | Paper |
| The Spanning Trees Formulas in a Class of Double Fixed-Step Loop Networks (Extended Abstract) | 2019-09-16 | Paper |
| The Asymptotic Number of Spanning Trees in Circulant Graphs (Extended Abstract) | 2019-09-16 | Paper |
| The transfer matrices and the capacity of the 2-dimensional \((1, \infty)\)-runlength limited constraint | 2019-02-20 | Paper |
| The channel capacity of read/write isolated memory | 2015-12-07 | Paper |
| The formulas for the number of spanning trees in circulant graphs | 2015-06-29 | Paper |
| Some properties complementary to Brualdi-Li matrices. | 2015-05-06 | Paper |
| Pseudo-tournament matrices and their eigenvalues | 2014-11-17 | Paper |
| Pseudo-tournament matrices and their eigenvalues | 2014-11-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5416066 | 2014-05-19 | Paper |
| Modified parallel multisplitting iterative methods for non-Hermitian positive definite systems | 2013-06-14 | Paper |
| On the spectral characterization of some unicyclic graphs | 2012-04-13 | Paper |
| A volume first maxima-finding algorithm | 2012-01-09 | Paper |
| Which wheel graphs are determined by their Laplacian spectra? | 2010-06-28 | Paper |
| The asymptotic number of spanning trees in circulant graphs | 2010-04-27 | Paper |
| An efficient approach for counting the number of spanning trees in circulant and related graphs | 2010-04-27 | Paper |
| Counting the number of spanning trees in a class of double fixed-step loop networks | 2010-02-12 | Paper |
| Spectral characterizations of sandglass graphs | 2009-11-06 | Paper |
| The lollipop graph is determined by its \(Q\)-spectrum | 2009-06-23 | Paper |
| The number of spanning trees in a class of double fixed-step loop networks | 2008-10-08 | Paper |
| Further analysis of the number of spanning trees in circulant graphs | 2007-01-09 | Paper |
| Chebyshev polynomials and spanning tree formulas for circulant and related graphs | 2005-09-22 | Paper |
| New upper and lower bounds on the channel capacity of read/write isolated memory | 2004-08-06 | Paper |
| On the distribution of eigenvalues of graphs | 2001-10-30 | Paper |
| Proof of a conjecture of Fiedler and Markham | 2001-09-19 | Paper |
| On the largest \(k\)th eigenvalues of trees with \(n\equiv 0 \pmod k\) | 2001-06-21 | Paper |
| A simple proof for the complexity of the square cycle \(C^ 2_ p\). | 2001-06-20 | Paper |
| On power graphs of cycles | 2001-06-20 | Paper |
| Group inverses of block matrices. | 2001-06-20 | Paper |
| A sufficient condition for real symmetric matrices to be orthogonally similar to irreducible diagonal matrices and some related properties. | 2001-06-20 | Paper |
| A new estimate for the roots of an arbitrary polynomial | 2001-06-20 | Paper |
| An upper bound estimate for determinants of metapositive definite and quasimetapositive definite sign-symmetric matrices | 2001-06-20 | Paper |
| Inverses of tridiagonal matrices and some new properties of them | 2001-06-20 | Paper |
| The convergence and rate of convergence of an interpolation method for solving \(f(x)=0\) | 2001-06-20 | Paper |
| The highest order \(k\)-step accurate computation formula for solving equation \(u'=f(t,u)\). | 2001-06-20 | Paper |
| The number of spanning trees of three special double fixed step loop networks | 2001-06-20 | Paper |
| Evaluation of an integral arising in compution the energy of crystals in terms of gamma functions | 2001-06-20 | Paper |
| A new necessary and sufficient condition for irreducibility of a matrix and a new algorithm for deciding irreducibility | 2001-06-20 | Paper |
| A necessary condition for a real matrix to have no real eigenvalues. | 2001-06-20 | Paper |
| Estimates of \(\|B^{-1}A\|\). I | 2001-06-20 | Paper |
| Distribution domains of eigenvalues of a class of matrices | 2001-06-20 | Paper |
| A homotopy method for solving a class of real symmetric positive definite pencils \(Ax=\lambda Bx\) | 2001-06-20 | Paper |
| On the ``DNICP property of the ``butterfly graph. | 2001-06-20 | Paper |
| Conditions for closure of Toeplitz matrices under products. | 2001-06-20 | Paper |
| Disproof of a conjecture on the existence of the path-recursive period for a connected graph | 2001-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4505753 | 2001-02-28 | Paper |
| The number of spanning trees in circulant graphs | 2000-12-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3836921 | 2000-04-26 | Paper |
| Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs | 2000-01-25 | Paper |
| On the distribution of eigenvalues of a simple undirected graph | 1999-11-29 | Paper |
| On a conjecture of Fiedler and Markham | 1999-09-02 | Paper |
| Elliptic matrices and their eigenpolynomials | 1998-12-03 | Paper |
| The numbers of spanning trees of the cubic cycle \(C_ n^ 3\) and the quadruple cycle \(C_ n^ 4\) | 1998-01-08 | Paper |
| An asymptotic property of the number of spanning trees of double fixed step loop networks | 1997-08-28 | Paper |
| Short Communication: Two Properties of Diagonally Dominant Matrices | 1997-01-06 | Paper |
