Weigen Yan - RankMe

58 papers Journal 58

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Counting matchable spanning trees of join graphs. Appl. Math. Comput. Jinqiu Zhou, Danyi Li, Weigen Yan
2026	J	`jnl`	Extremal graphs with bounded matching number: a short proof of the Alon-Frankl theorem. Discret. Math. Xing Feng, Weigen Yan, Jinqiu Zhou
2026	J	`jnl`	Resistance distance in blowup graphs. Discret. Math. Yaqian Wang, Danyi Li, Weigen Yan
2026	J	`jnl`	The Turán number of vertex disjoint paths of lengths one and two. Discret. Math. Jingchao Lai, Tianlong Ma, Weigen Yan
2025	J	`jnl`	A Variant of the Teufl-Wagner Formula and Applications. J. Graph Theory Danyi Li, Weigen Yan
2025	J	`jnl`	Claw-Free Solid Bricks. Graphs Comb. Jinqiu Zhou, Xing Feng, Weigen Yan
2025	J	`jnl`	Combinatorial identities arising from permanents for Euler numbers and Stirling numbers. Adv. Appl. Math. Zhicong Lin, Weigen Yan, Tongyuan Zhao
2025	J	`jnl`	K4-free planar minimal bricks with the maximum number of edges. Discret. Appl. Math. Jinqiu Zhou, Xing Feng, Weigen Yan
2025	J	`jnl`	Minimal bricks with the maximum number of edges. J. Graph Theory Xing Feng, Weigen Yan
2025	J	`jnl`	On saturated non-covered graphs. Discret. Appl. Math. Jinqiu Zhou, Yuefen Cao, Weigen Yan
2025	J	`jnl`	On the number of perfect matchings of middle graphs. Discret. Appl. Math. Jingchao Lai, Weigen Yan, Xing Feng
2025	J	`jnl`	The Laplacian characteristic polynomial of the path-tree of the complete graph. Discret. Appl. Math. Jinqiu Zhou, Weigen Yan
2024	J	`jnl`	Enumeration of perfect matchings of the middle graph of a graph Discret. Math. Jingchao Lai, Weigen Yan, Xing Feng
2024	J	`jnl`	Enumeration of spanning trees with a perfect matching of hexagonal lattices on the cylinder and Möbius strip. Discret. Appl. Math. Danyi Li, Xing Feng, Weigen Yan
2024	J	`jnl`	On the edge reconstruction of the characteristic and permanental polynomials of a simple graph. Discret. Math. Jingyuan Zhang, Xian'an Jin, Weigen Yan, Qinghai Liu
2023	J	`jnl`	Combinatorial explanation of the weighted Laplacian characteristic polynomial of a graph and applications. Appl. Math. Comput. Linghai Liu, Weigen Yan
2023	J	`jnl`	Counting spanning trees with a Kekulé structure in linear hexagonal chains. Appl. Math. Comput. Danyi Li, Weigen Yan
2023	J	`jnl`	Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest. J. Graph Theory Danyi Li, Wuxian Chen, Weigen Yan
2023	J	`jnl`	Identifying Plagiarised Programming Assignments with Detection Tool Consensus. Informatics Educ. Hayden Cheers, Yuqing Lin, Weigen Yan
2023	J	`jnl`	On the dimer problem of the vertex-edge graph of a cubic graph. Discret. Math. Shuli Li, Danyi Li, Weigen Yan
2022	J	`jnl`	A type of generalized mesh-star transformation and applications in electrical networks. Discret. Appl. Math. Sujing Cheng, Wuxian Chen, Weigen Yan
2022	J	`jnl`	Combinatorial explanation of coefficients of the Laplacian matching polynomial of graphs. Discret. Math. Danyi Li, Weigen Yan
2022	J	`jnl`	Combinatorial explanation of the weighted Wiener (Kirchhoff) index of trees and unicyclic graphs. Discret. Math. Shuli Li, Danyi Li, Weigen Yan
2022	J	`jnl`	On eigenvalues and the energy of dendrimer trees. Appl. Math. Comput. Hengmeng Xu, Weigen Yan
2022	J	`jnl`	Solving combinatorially the monomer-dimer problem on certain fractal scale-free lattices. Adv. Appl. Math. Danyi Li, Weigen Yan, Shuli Li
2021	J	`jnl`	On the Kirchhoff index of a unicyclic graph and the matchings of the subdivision. Discret. Appl. Math. Yulan Chen, Weigen Yan
2021	J	`jnl`	Resistance distances in vertex-weighted complete multipartite graphs. Appl. Math. Comput. Wuxian Chen, Weigen Yan
2020	J	`jnl`	A New Proof of Foster's First Theorem. Am. Math. Mon. Jingyuan Zhang, Weigen Yan
2020	J	`jnl`	Using edge generating function to solve monomer-dimer problem. Adv. Appl. Math. Guoce Xin, Weigen Yan
2019	J	`jnl`	Resistance between two vertices of almost complete bipartite graphs. Discret. Appl. Math. Luzhen Ye, Weigen Yan
2019	J	`jnl`	Resistances between two nodes of a path network. Appl. Math. Comput. Zhuozhuo Jiang, Weigen Yan
2018	J	`jnl`	Spanning trees and dimer problem on the Cairo pentagonal lattice. Appl. Math. Comput. Shuli Li, Weigen Yan
2018	J	`jnl`	Spectra of the generalized edge corona of graphs. Discret. Math. Algorithms Appl. Yanyan Luo, Weigen Yan
2017	J	`jnl`	Enumeration of spanning trees of middle graphs. Appl. Math. Comput. Weigen Yan
2017	J	`jnl`	Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs. J. Graph Theory Fengming Dong, Weigen Yan
2016	J	`jnl`	Extremal matching energy of complements of trees. Discuss. Math. Graph Theory Tingzeng Wu, Weigen Yan, Heping Zhang
2014	J	`jnl`	The matching energy of graphs with given parameters. Discret. Appl. Math. Shuli Li, Weigen Yan
2013	J	`jnl`	On the number of perfect matchings of line graphs. Discret. Appl. Math. Fengming Dong, Weigen Yan, Fuji Zhang
2013	J	`jnl`	On the number of spanning trees of some irregular line graphs. J. Comb. Theory A Weigen Yan
2012	J	`jnl`	Kekulé structures of polyomino chains and the Hosoya index of caterpillar trees. Discret. Math. Shuli Li, Weigen Yan
2012	J	`jnl`	The asymptotic behavior of some indices of iterated line graphs of regular graphs. Discret. Appl. Math. Weigen Yan, Yeong-Nan Yeh, Fuji Zhang
2011	J	`jnl`	Enumeration of spanning trees of graphs with rotational symmetry. J. Comb. Theory A Weigen Yan, Fuji Zhang
2009	J	`jnl`	Enumerating spanning trees of graphs with an involution. J. Comb. Theory A Fuji Zhang, Weigen Yan
2009	J	`jnl`	On the matching polynomial of subdivision graphs. Discret. Appl. Math. Weigen Yan, Yeong-Nan Yeh
2008	J	`jnl`	A quadratic identity for the number of perfect matchings of plane graphs. Theor. Comput. Sci. Weigen Yan, Fuji Zhang
2007	J	`jnl`	Replacing Pfaffians and applications. Adv. Appl. Math. Weigen Yan, Yeong-Nan Yeh
2007	J	`jnl`	The behavior of Wiener indices and polynomials of graphs under five graph decorations. Appl. Math. Lett. Weigen Yan, Bo-Yin Yang, Yeong-Nan Yeh
2007	J	`jnl`	The determinants of Adv. Appl. Math. Weigen Yan, Yeong-Nan Yeh
2006	J	`jnl`	A simple proof of Graham and Pollak's theorem. J. Comb. Theory A Weigen Yan, Yeong-Nan Yeh
2006	J	`jnl`	Enumeration of perfect matchings of a type of Cartesian products of graphs. Discret. Appl. Math. Weigen Yan, Fuji Zhang
2006	J	`jnl`	Enumeration of subtrees of trees. Theor. Comput. Sci. Weigen Yan, Yeong-Nan Yeh
2005	J	`jnl`	Graphical condensation for enumerating perfect matchings. J. Comb. Theory A Weigen Yan, Fuji Zhang
2005	J	`jnl`	Graphical condensation of plane graphs: A combinatorial approach. Theor. Comput. Sci. Weigen Yan, Yeong-Nan Yeh, Fuji Zhang
2005	J	`jnl`	Indices of convergence on four digraph operators. Australas. J Comb. Weigen Yan, Fuju Zhang
2005	J	`jnl`	On the minimal energy of trees with a given diameter. Appl. Math. Lett. Weigen Yan, Luzhen Ye
2005	J	`jnl`	The number of spanning trees of plane graphs with reflective symmetry. J. Comb. Theory A Mihai Ciucu, Weigen Yan, Fuji Zhang
2004	J	`jnl`	Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians. Adv. Appl. Math. Weigen Yan, Fuji Zhang
2003	J	`jnl`	Heredity of the index of convergence of the line digraph. Discret. Appl. Math. Weigen Yan, Fuji Zhang