The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Xuerong Yong: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Mordecai J. Golin, Yiu-Cho Leung, Yajun Wang, Xuerong Yong
    Counting Structures in Grid Graphs, Cylinders and Tori Using Transfer Matrices: Survey and New Results. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALCO, 2005, pp:250-258 [Conf]
  2. Xuerong Yong
    On the Distribution of Eigenvalues of Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 1996, pp:268-272 [Conf]
  3. Xuerong Yong, Mordecai J. Golin
    New Techniques for Bounding the Channel Capacity of Read/Write Isolated Memor. [Citation Graph (0, 0)][DBLP]
    DCC, 2002, pp:482- [Conf]
  4. Mordecai J. Golin, Xuerong Yong, Yuanping Zhang, Li Sheng
    New upper and lower bounds on the channel capacity of read/write isolated memory. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:140, n:1-3, pp:35-48 [Journal]
  5. Yuanping Zhang, Xuerong Yong, Mordecai J. Golin
    The number of spanning trees in circulant graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:223, n:1-3, pp:337-350 [Journal]
  6. Yuanping Zhang, Xuerong Yong, Mordecai J. Golin
    Chebyshev polynomials and spanning tree formulas for circulant and related graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:298, n:1-3, pp:334-364 [Journal]
  7. Talip Atajan, Xuerong Yong, Hiroshi Inaba
    Further analysis of the number of spanning trees in circulant graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:22, pp:2817-2827 [Journal]
  8. Xuerong Yong
    Analyzing the codes that avoid specified differences by binary tree. [Citation Graph (0, 0)][DBLP]
    ISICT, 2003, pp:144-149 [Conf]
  9. Alexander K. Kelmans, Xuerong Yong
    On the distribution of eigenvalues of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:199, n:1-3, pp:251-258 [Journal]

  10. Spectral characterizations of sandglass graphs. [Citation Graph (, )][DBLP]


  11. Counting the number of spanning trees in a class of double fixed-step loop networks. [Citation Graph (, )][DBLP]


  12. The lollipop graph is determined by its Q-spectrum. [Citation Graph (, )][DBLP]


  13. The asymptotic number of spanning trees in circulant graphs. [Citation Graph (, )][DBLP]


  14. An efficient approach for counting the number of spanning trees in circulant and related graphs. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002