Heredity of the index of convergence of the line digraph. - Weigen Yan; Fuji Zhang (Discret. Appl. Math., 2003)

Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians. - Weigen Yan; Fuji Zhang (Adv. Appl. Math., 2004)

Indices of convergence on four digraph operators. - Weigen Yan; Fuju Zhang (Australas. J Comb., 2005)

On the minimal energy of trees with a given diameter. - Weigen Yan; Luzhen Ye (Appl. Math. Lett., 2005)

The number of spanning trees of plane graphs with reflective symmetry. - Mihai Ciucu; Weigen Yan; Fuji Zhang (J. Comb. Theory A, 2005)

Graphical condensation for enumerating perfect matchings. - Weigen Yan; Fuji Zhang (J. Comb. Theory A, 2005)

Graphical condensation of plane graphs: A combinatorial approach. - Weigen Yan; Yeong-Nan Yeh; Fuji Zhang (Theor. Comput. Sci., 2005)

Enumeration of perfect matchings of a type of Cartesian products of graphs. - Weigen Yan; Fuji Zhang (Discret. Appl. Math., 2006)

A simple proof of Graham and Pollak's theorem. - Weigen Yan; Yeong-Nan Yeh (J. Comb. Theory A, 2006)

Enumeration of subtrees of trees. - Weigen Yan; Yeong-Nan Yeh (Theor. Comput. Sci., 2006)

Replacing Pfaffians and applications. - Weigen Yan; Yeong-Nan Yeh (Adv. Appl. Math., 2007)

The determinants of q-distance matrices of trees and two quantities relating to permutations. - Weigen Yan; Yeong-Nan Yeh (Adv. Appl. Math., 2007)

The behavior of Wiener indices and polynomials of graphs under five graph decorations. - Weigen Yan; Bo-Yin Yang; Yeong-Nan Yeh (Appl. Math. Lett., 2007)

A quadratic identity for the number of perfect matchings of plane graphs. - Weigen Yan; Fuji Zhang (Theor. Comput. Sci., 2008)

On the matching polynomial of subdivision graphs. - Weigen Yan; Yeong-Nan Yeh (Discret. Appl. Math., 2009)

Enumerating spanning trees of graphs with an involution. - Fuji Zhang; Weigen Yan (J. Comb. Theory A, 2009)

Enumeration of spanning trees of graphs with rotational symmetry. - Weigen Yan; Fuji Zhang (J. Comb. Theory A, 2011)

The asymptotic behavior of some indices of iterated line graphs of regular graphs. - Weigen Yan; Yeong-Nan Yeh; Fuji Zhang (Discret. Appl. Math., 2012)

Kekulé structures of polyomino chains and the Hosoya index of caterpillar trees. - Shuli Li; Weigen Yan (Discret. Math., 2012)

On the number of perfect matchings of line graphs. - Fengming Dong; Weigen Yan; Fuji Zhang (Discret. Appl. Math., 2013)

On the number of spanning trees of some irregular line graphs. - Weigen Yan (J. Comb. Theory A, 2013)

The matching energy of graphs with given parameters. - Shuli Li; Weigen Yan (Discret. Appl. Math., 2014)

Extremal matching energy of complements of trees. - Tingzeng Wu; Weigen Yan; Heping Zhang (Discuss. Math. Graph Theory, 2016)

Enumeration of spanning trees of middle graphs. - Weigen Yan (Appl. Math. Comput., 2017)

Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs. - Fengming Dong; Weigen Yan (J. Graph Theory, 2017)

Spanning trees and dimer problem on the Cairo pentagonal lattice. - Shuli Li; Weigen Yan (Appl. Math. Comput., 2018)

Spectra of the generalized edge corona of graphs. - Yanyan Luo; Weigen Yan (Discret. Math. Algorithms Appl., 2018)

Resistances between two nodes of a path network. - Zhuozhuo Jiang; Weigen Yan (Appl. Math. Comput., 2019)

Resistance between two vertices of almost complete bipartite graphs. - Luzhen Ye; Weigen Yan (Discret. Appl. Math., 2019)

Using edge generating function to solve monomer-dimer problem. - Guoce Xin; Weigen Yan (Adv. Appl. Math., 2020)

A New Proof of Foster's First Theorem. - Jingyuan Zhang; Weigen Yan (Am. Math. Mon., 2020)

Resistance distances in vertex-weighted complete multipartite graphs. - Wuxian Chen; Weigen Yan (Appl. Math. Comput., 2021)

On the Kirchhoff index of a unicyclic graph and the matchings of the subdivision. - Yulan Chen; Weigen Yan (Discret. Appl. Math., 2021)

Solving combinatorially the monomer-dimer problem on certain fractal scale-free lattices. - Danyi Li; Weigen Yan; Shuli Li (Adv. Appl. Math., 2022)

On eigenvalues and the energy of dendrimer trees. - Hengmeng Xu; Weigen Yan (Appl. Math. Comput., 2022)

A type of generalized mesh-star transformation and applications in electrical networks. - Sujing Cheng; Wuxian Chen; Weigen Yan (Discret. Appl. Math., 2022)

Combinatorial explanation of the weighted Wiener (Kirchhoff) index of trees and unicyclic graphs. - Shuli Li; Danyi Li; Weigen Yan (Discret. Math., 2022)

Combinatorial explanation of coefficients of the Laplacian matching polynomial of graphs. - Danyi Li; Weigen Yan (Discret. Math., 2022)

Counting spanning trees with a Kekulé structure in linear hexagonal chains. - Danyi Li; Weigen Yan (Appl. Math. Comput., 2023)

Identifying Plagiarised Programming Assignments with Detection Tool Consensus. - Hayden Cheers; Yuqing Lin; Weigen Yan (Informatics Educ., 2023)

On the dimer problem of the vertex-edge graph of a cubic graph. - Shuli Li; Danyi Li; Weigen Yan (Discret. Math., 2023)

Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest. - Danyi Li; Wuxian Chen; Weigen Yan (J. Graph Theory, 2023)

Combinatorial explanation of the weighted Laplacian characteristic polynomial of a graph and applications. - Linghai Liu; Weigen Yan (Appl. Math. Comput., 2023)

Enumeration of spanning trees with a perfect matching of hexagonal lattices on the cylinder and Möbius strip. - Danyi Li; Xing Feng; Weigen Yan (Discret. Appl. Math., 2024)

On the edge reconstruction of the characteristic and permanental polynomials of a simple graph. - Jingyuan Zhang; Xian'an Jin; Weigen Yan; Qinghai Liu (Discret. Math., 2024)

Enumeration of perfect matchings of the middle graph of a graph G with △(G)≤4. - Jingchao Lai; Weigen Yan; Xing Feng (Discret. Math., 2024)

Combinatorial identities arising from permanents for Euler numbers and Stirling numbers. - Zhicong Lin; Weigen Yan; Tongyuan Zhao (Adv. Appl. Math., 2025)

On the number of perfect matchings of middle graphs. - Jingchao Lai; Weigen Yan; Xing Feng (Discret. Appl. Math., 2025)

On saturated non-covered graphs. - Jinqiu Zhou; Yuefen Cao; Weigen Yan (Discret. Appl. Math., 2025)

K4-free planar minimal bricks with the maximum number of edges. - Jinqiu Zhou; Xing Feng; Weigen Yan (Discret. Appl. Math., 2025)

The Laplacian characteristic polynomial of the path-tree of the complete graph. - Jinqiu Zhou; Weigen Yan (Discret. Appl. Math., 2025)