Weigen Yan

According to our database, Weigen Yan authored at least 43 papers between 2003 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

Enumeration of perfect matchings of the middle graph of a graph <i>G</i> with △(<i>G</i>)≤4.

Jingchao Lai, Weigen Yan, Xing Feng

Discret. Math., April, 2024

2023

Combinatorial explanation of the weighted Laplacian characteristic polynomial of a graph and applications.

Linghai Liu, Weigen Yan

Appl. Math. Comput., November, 2023

Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest.

Danyi Li, Wuxian Chen, Weigen Yan

J. Graph Theory, September, 2023

On the dimer problem of the vertex-edge graph of a cubic graph.

Shuli Li, Danyi Li, Weigen Yan

Discret. Math., August, 2023

Counting spanning trees with a Kekulé structure in linear hexagonal chains.

Danyi Li, Weigen Yan

Appl. Math. Comput., 2023

2022

Combinatorial explanation of coefficients of the Laplacian matching polynomial of graphs.

Danyi Li, Weigen Yan

Discret. Math., 2022

Combinatorial explanation of the weighted Wiener (Kirchhoff) index of trees and unicyclic graphs.

Shuli Li, Danyi Li, Weigen Yan

Discret. Math., 2022

A type of generalized mesh-star transformation and applications in electrical networks.

Sujing Cheng, Wuxian Chen, Weigen Yan

Discret. Appl. Math., 2022

On eigenvalues and the energy of dendrimer trees.

Hengmeng Xu, Weigen Yan

Appl. Math. Comput., 2022

Solving combinatorially the monomer-dimer problem on certain fractal scale-free lattices.

Danyi Li, Weigen Yan, Shuli Li

Adv. Appl. Math., 2022

2021

On the Kirchhoff index of a unicyclic graph and the matchings of the subdivision.

Yulan Chen, Weigen Yan

Discret. Appl. Math., 2021

Resistance distances in vertex-weighted complete multipartite graphs.

Wuxian Chen, Weigen Yan

Appl. Math. Comput., 2021

2020

A New Proof of Foster's First Theorem.

Jingyuan Zhang, Weigen Yan

Am. Math. Mon., 2020

Using edge generating function to solve monomer-dimer problem.

Guoce Xin, Weigen Yan

Adv. Appl. Math., 2020

2019

Resistance between two vertices of almost complete bipartite graphs.

Luzhen Ye, Weigen Yan

Discret. Appl. Math., 2019

Resistances between two nodes of a path network.

Zhuozhuo Jiang, Weigen Yan

Appl. Math. Comput., 2019

2018

Spectra of the generalized edge corona of graphs.

Yanyan Luo, Weigen Yan

Discret. Math. Algorithms Appl., 2018

Spanning trees and dimer problem on the Cairo pentagonal lattice.

Shuli Li, Weigen Yan

Appl. Math. Comput., 2018

2017

Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs.

Fengming Dong, Weigen Yan

J. Graph Theory, 2017

Enumeration of spanning trees of middle graphs.

Weigen Yan

Appl. Math. Comput., 2017

2016

Extremal matching energy of complements of trees.

Tingzeng Wu, Weigen Yan, Heping Zhang

Discuss. Math. Graph Theory, 2016

2014

The matching energy of graphs with given parameters.

Shuli Li, Weigen Yan

Discret. Appl. Math., 2014

2013

On the number of spanning trees of some irregular line graphs.

Weigen Yan

J. Comb. Theory, Ser. A, 2013

On the number of perfect matchings of line graphs.

Fengming Dong, Weigen Yan, Fuji Zhang

Discret. Appl. Math., 2013

2012

Kekulé structures of polyomino chains and the Hosoya index of caterpillar trees.

Shuli Li, Weigen Yan

Discret. Math., 2012

The asymptotic behavior of some indices of iterated line graphs of regular graphs.

Weigen Yan, Yeong-Nan Yeh, Fuji Zhang

Discret. Appl. Math., 2012

2011

Enumeration of spanning trees of graphs with rotational symmetry.

Weigen Yan, Fuji Zhang

J. Comb. Theory, Ser. A, 2011

2009

Enumerating spanning trees of graphs with an involution.

Fuji Zhang, Weigen Yan

J. Comb. Theory, Ser. A, 2009

On the matching polynomial of subdivision graphs.

Weigen Yan, Yeong-Nan Yeh

Discret. Appl. Math., 2009

2008

A quadratic identity for the number of perfect matchings of plane graphs.

Weigen Yan, Fuji Zhang

Theor. Comput. Sci., 2008

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

The determinants of <i>q</i>-distance matrices of trees and two quantities relating to permutations.

Weigen Yan, Yeong-Nan Yeh

Adv. Appl. Math., 2007

Replacing Pfaffians and applications.

Weigen Yan, Yeong-Nan Yeh

Adv. Appl. Math., 2007

2006

Enumeration of subtrees of trees.

Weigen Yan, Yeong-Nan Yeh

Theor. Comput. Sci., 2006

A simple proof of Graham and Pollak's theorem.

Weigen Yan, Yeong-Nan Yeh

J. Comb. Theory, Ser. A, 2006

Enumeration of perfect matchings of a type of Cartesian products of graphs.

Weigen Yan, Fuji Zhang

Discret. Appl. Math., 2006

2005

Graphical condensation of plane graphs: A combinatorial approach.

Weigen Yan, Yeong-Nan Yeh, Fuji Zhang

Theor. Comput. Sci., 2005

Graphical condensation for enumerating perfect matchings.

Weigen Yan, Fuji Zhang

J. Comb. Theory, Ser. A, 2005

The number of spanning trees of plane graphs with reflective symmetry.

Mihai Ciucu, Weigen Yan, Fuji Zhang

J. Comb. Theory, Ser. A, 2005

On the minimal energy of trees with a given diameter.

Weigen Yan, Luzhen Ye

Appl. Math. Lett., 2005

Indices of convergence on four digraph operators.

Weigen Yan, Fuju Zhang

Australas. J Comb., 2005

2004

Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians.

Weigen Yan, Fuji Zhang

Adv. Appl. Math., 2004

2003

Heredity of the index of convergence of the line digraph.

Weigen Yan, Fuji Zhang

Discret. Appl. Math., 2003