default search action
Weigen Yan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j45]Danyi Li, Xing Feng, Weigen Yan
:
Enumeration of spanning trees with a perfect matching of hexagonal lattices on the cylinder and Möbius strip. Discret. Appl. Math. 358: 320-325 (2024) - [j44]Jingchao Lai, Weigen Yan, Xing Feng:
Enumeration of perfect matchings of the middle graph of a graph G with △(G)≤4. Discret. Math. 347(4): 113847 (2024) - [j43]Jingyuan Zhang, Xian'an Jin, Weigen Yan, Qinghai Liu:
On the edge reconstruction of the characteristic and permanental polynomials of a simple graph. Discret. Math. 347(9): 114063 (2024) - 2023
- [j42]Danyi Li, Weigen Yan
Counting spanning trees with a Kekulé structure in linear hexagonal chains. Appl. Math. Comput. 456: 128125 (2023) - [j41]Linghai Liu, Weigen Yan:
Combinatorial explanation of the weighted Laplacian characteristic polynomial of a graph and applications. Appl. Math. Comput. 457: 128187 (2023) - [j40]Shuli Li
On the dimer problem of the vertex-edge graph of a cubic graph. Discret. Math. 346(8): 113427 (2023) - [j39]Danyi Li, Wuxian Chen, Weigen Yan
Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest. J. Graph Theory 104(1): 160-170 (2023) - 2022
- [j38]Danyi Li, Weigen Yan, Shuli Li
Solving combinatorially the monomer-dimer problem on certain fractal scale-free lattices. Adv. Appl. Math. 137: 102340 (2022) - [j37]Hengmeng Xu, Weigen Yan
On eigenvalues and the energy of dendrimer trees. Appl. Math. Comput. 424: 127051 (2022) - [j36]Sujing Cheng, Wuxian Chen
A type of generalized mesh-star transformation and applications in electrical networks. Discret. Appl. Math. 320: 259-269 (2022) - [j35]Danyi Li, Weigen Yan:
Combinatorial explanation of coefficients of the Laplacian matching polynomial of graphs. Discret. Math. 345(5): 112812 (2022) - [j34]Shuli Li
Combinatorial explanation of the weighted Wiener (Kirchhoff) index of trees and unicyclic graphs. Discret. Math. 345(12): 113109 (2022) - 2021
- [j33]Wuxian Chen, Weigen Yan:
Resistance distances in vertex-weighted complete multipartite graphs. Appl. Math. Comput. 409: 126382 (2021) - [j32]Yulan Chen
On the Kirchhoff index of a unicyclic graph and the matchings of the subdivision. Discret. Appl. Math. 300: 19-24 (2021) - 2020
- [j31]Guoce Xin, Weigen Yan:
Using edge generating function to solve monomer-dimer problem. Adv. Appl. Math. 121: 102082 (2020) - [j30]Jingyuan Zhang, Weigen Yan:
A New Proof of Foster's First Theorem. Am. Math. Mon. 127(1): 72-74 (2020)
2010 – 2019
- 2019
- [j29]Zhuozhuo Jiang, Weigen Yan
Resistances between two nodes of a path network. Appl. Math. Comput. 361: 42-46 (2019) - [j28]Luzhen Ye, Weigen Yan
Resistance between two vertices of almost complete bipartite graphs. Discret. Appl. Math. 257: 299-305 (2019) - 2018
- [j27]Shuli Li
Spanning trees and dimer problem on the Cairo pentagonal lattice. Appl. Math. Comput. 337: 34-40 (2018) - [j26]Yanyan Luo, Weigen Yan:
Spectra of the generalized edge corona of graphs. Discret. Math. Algorithms Appl. 10(1): 1850002:1-1850002:10 (2018) - 2017
- [j25]Weigen Yan:
Enumeration of spanning trees of middle graphs. Appl. Math. Comput. 307: 239-243 (2017) - [j24]Fengming Dong
Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs. J. Graph Theory 85(1): 74-93 (2017) - 2016
- [j23]Tingzeng Wu
Extremal matching energy of complements of trees. Discuss. Math. Graph Theory 36(3): 505-521 (2016) - 2014
- [j22]Shuli Li
The matching energy of graphs with given parameters. Discret. Appl. Math. 162: 415-420 (2014) - 2013
- [j21]Fengming Dong
On the number of perfect matchings of line graphs. Discret. Appl. Math. 161(6): 794-801 (2013) - [j20]Weigen Yan:
On the number of spanning trees of some irregular line graphs. J. Comb. Theory A 120(7): 1642-1648 (2013) - 2012
- [j19]Weigen Yan, Yeong-Nan Yeh, Fuji Zhang:
The asymptotic behavior of some indices of iterated line graphs of regular graphs. Discret. Appl. Math. 160(7-8): 1232-1239 (2012) - [j18]Shuli Li
Kekulé structures of polyomino chains and the Hosoya index of caterpillar trees. Discret. Math. 312(15): 2397-2400 (2012) - 2011
- [j17]Weigen Yan, Fuji Zhang:
Enumeration of spanning trees of graphs with rotational symmetry. J. Comb. Theory A 118(4): 1270-1290 (2011)
2000 – 2009
- 2009
- [j16]Weigen Yan, Yeong-Nan Yeh:
On the matching polynomial of subdivision graphs. Discret. Appl. Math. 157(1): 195-200 (2009) - [j15]Fuji Zhang, Weigen Yan:
Enumerating spanning trees of graphs with an involution. J. Comb. Theory A 116(3): 650-662 (2009) - 2008
- [j14]Weigen Yan, Fuji Zhang:
A quadratic identity for the number of perfect matchings of plane graphs. Theor. Comput. Sci. 409(3): 405-410 (2008) - 2007
- [j13]Weigen Yan, Yeong-Nan Yeh:
Replacing Pfaffians and applications. Adv. Appl. Math. 39(1): 121-140 (2007) - [j12]Weigen Yan, Yeong-Nan Yeh:
The determinants of q-distance matrices of trees and two quantities relating to permutations. Adv. Appl. Math. 39(3): 311-321 (2007) - [j11]Weigen Yan, Bo-Yin Yang, Yeong-Nan Yeh:
The behavior of Wiener indices and polynomials of graphs under five graph decorations. Appl. Math. Lett. 20(3): 290-295 (2007) - 2006
- [j10]Weigen Yan, Fuji Zhang:
Enumeration of perfect matchings of a type of Cartesian products of graphs. Discret. Appl. Math. 154(1): 145-157 (2006) - [j9]Weigen Yan, Yeong-Nan Yeh:
A simple proof of Graham and Pollak's theorem. J. Comb. Theory A 113(5): 892-893 (2006) - [j8]Weigen Yan, Yeong-Nan Yeh:
Enumeration of subtrees of trees. Theor. Comput. Sci. 369(1-3): 256-268 (2006) - 2005
- [j7]Weigen Yan, Fuju Zhang:
Indices of convergence on four digraph operators. Australas. J Comb. 31: 249-262 (2005) - [j6]Weigen Yan, Luzhen Ye:
On the minimal energy of trees with a given diameter. Appl. Math. Lett. 18(9): 1046-1052 (2005) - [j5]Weigen Yan, Fuji Zhang:
Graphical condensation for enumerating perfect matchings. J. Comb. Theory A 110(1): 113-125 (2005) - [j4]Mihai Ciucu, Weigen Yan, Fuji Zhang:
The number of spanning trees of plane graphs with reflective symmetry. J. Comb. Theory A 112(1): 105-116 (2005) - [j3]Weigen Yan, Yeong-Nan Yeh, Fuji Zhang:
Graphical condensation of plane graphs: A combinatorial approach. Theor. Comput. Sci. 349(3): 452-461 (2005) - 2004
- [j2]Weigen Yan, Fuji Zhang:
Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians. Adv. Appl. Math. 32(4): 655-668 (2004) - 2003
- [j1]Weigen Yan, Fuji Zhang:
Heredity of the index of convergence of the line digraph. Discret. Appl. Math. 131(3): 681-688 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 01:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: