Author of the publication

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

, , and . Networks, 52 (2): 69-77 (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

The Spanning Trees Formulas in a Class of Double Fixed-Step Loop Networks., , and . ANALCO, page 17-22. SIAM, (2009)A volume first maxima-finding algorithm., , , and . Theor. Comput. Sci., 412 (45): 6316-6326 (2011)New upper and lower bounds on the channel capacity of read/write isolated memory., , , and . Discret. Appl. Math., 140 (1-3): 35-48 (2004)Chebyshev polynomials and spanning tree formulas for circulant and related graphs., , and . Discret. Math., 298 (1-3): 334-364 (2005)The formulas for the number of spanning trees in circulant graphs., , , and . Discret. Math., 338 (11): 1883-1906 (2015)The transfer matrices and the capacity of the 2-dimensional (1, ∞)-runlength limited constraint., , and . Discret. Math., 342 (4): 975-987 (2019)The lollipop graph is determined by its Q-spectrum., , , and . Discret. Math., 309 (10): 3364-3369 (2009)Counting Structures in Grid Graphs, Cylinders and Tori Using Transfer Matrices: Survey and New Results., , , and . ALENEX/ANALCO, page 250-258. SIAM, (2005)The asymptotic number of spanning trees in circulant graphs., , and . Discret. Math., 310 (4): 792-803 (2010)The numbers of spanning trees of the cubic cycle CN3 and the quadruple cycle CN4., and . Discret. Math., 169 (1-3): 293-298 (1997)