Xuerong Yong

Symmetry, 2022

2019

The transfer matrices and the capacity of the 2-dimensional (1, ∞)-runlength limited constraint.

[BibT_eX]

[DOI]

Zhibing Chen

Discret. Math., 2019

Explicit solutions of the Yang-Baxter-like matrix equation for a diagonalizable matrix with spectrum contained in {1, α, 0}.

[BibT_eX]

[DOI]

Dongmei Chen

Zhibing Chen

Appl. Math. Comput., 2019

2016

The channel capacity of read/write isolated memory.

[BibT_eX]

[DOI]

Chuan-Long Wang

Discret. Appl. Math., 2016

2015

The formulas for the number of spanning trees in circulant graphs.

[BibT_eX]

[DOI]

Discret. Math., 2015

2013

Modified parallel multisplitting iterative methods for non-Hermitian positive definite systems.

[BibT_eX]

[DOI]

Chuan-Long Wang

Guo-Yan Meng

Adv. Comput. Math., 2013

2011

A volume first maxima-finding algorithm.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

On the spectral characterization of some unicyclic graphs.

[BibT_eX]

[DOI]

Discret. Math., 2011

2010

The asymptotic number of spanning trees in circulant graphs.

[BibT_eX]

[DOI]

Discret. Math., 2010

An efficient approach for counting the number of spanning trees in circulant and related graphs.

[BibT_eX]

[DOI]

Hiroshi Inaba

Discret. Math., 2010

Counting the number of spanning trees in a class of double fixed-step loop networks.

[BibT_eX]

[DOI]

Naohisa Otsuka

Appl. Math. Lett., 2010

2009

The lollipop graph is determined by its Q-spectrum.

[BibT_eX]

[DOI]

Discret. Math., 2009

Which wheel graphs are determined by their Laplacian spectra?

[BibT_eX]

[DOI]

Xiaogang Liu

Comput. Math. Appl., 2009

Spectral characterizations of sandglass graphs.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2009

The Spanning Trees Formulas in a Class of Double Fixed-Step Loop Networks.

[BibT_eX]

[DOI]

Naohisa Otsuka

Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics, 2009

2008

The number of spanning trees in a class of double fixed-step loop networks.

[BibT_eX]

[DOI]

Networks, 2008

2006

Further analysis of the number of spanning trees in circulant graphs.

[BibT_eX]

[DOI]

Hiroshi Inaba

Discret. Math., 2006

2005

Chebyshev polynomials and spanning tree formulas for circulant and related graphs.

[BibT_eX]

[DOI]

Discret. Math., 2005

Counting Structures in Grid Graphs, Cylinders and Tori Using Transfer Matrices: Survey and New Results.

[BibT_eX]

[DOI]

Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, 2005

2004

New upper and lower bounds on the channel capacity of read/write isolated memory.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

2003

Analyzing the codes that avoid specified differences by binary tree.

[BibT_eX]

[DOI]

Proceedings of the 1st Intenational Symposium on Information and Communication Technologies, 2003

2002

New Techniques for Bounding the Channel Capacity of Read/Write Isolated Memor.

[BibT_eX]

[DOI]

Proceedings of the 2002 Data Compression Conference (DCC 2002), 2002

2000

The number of spanning trees in circulant graphs.

[BibT_eX]

[DOI]

Discret. Math., 2000

1999

On the distribution of eigenvalues of graphs.

[BibT_eX]

[DOI]

Alexander K. Kelmans

Discret. Math., 1999

1997

The numbers of spanning trees of the cubic cycle CN3 and the quadruple cycle CN4.

[BibT_eX]

[DOI]

Talip Acenjian

Discret. Math., 1997

1996

On the Distribution of Eigenvalues of Graphs.

[BibT_eX]

[DOI]