The following pages link to Weigen Yan (Q315679):
Displaying 32 items.
- Enumeration of perfect matchings of a type of Cartesian products of graphs (Q2581564) (← links)
- Combinatorial explanation of the weighted Wiener (Kirchhoff) index of trees and unicyclic graphs (Q2675867) (← links)
- (Q2719943) (← links)
- (Q2856768) (← links)
- (Q2886178) (← links)
- (Q2914005) (← links)
- Some physical and chemical indices of the Union Jack lattice (Q3302189) (← links)
- (Q3377644) (← links)
- On the Monomer–Dimer Problem of Some Graphs (Q3560181) (← links)
- (Q4038073) (← links)
- Spectra of the generalized edge corona of graphs (Q4603868) (← links)
- (Q4659601) (← links)
- (Q4690388) (← links)
- (Q4801603) (← links)
- (Q4815828) (← links)
- (Q5012988) (← links)
- The super-connectivity of Kneser graph KG(n,3) (Q5080914) (← links)
- (Q5090529) (← links)
- (Q5124689) (← links)
- (Q5159249) (← links)
- (Q5196382) (← links)
- A New Proof of Foster’s First Theorem (Q5207481) (← links)
- Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs (Q5272634) (← links)
- (Q5279092) (← links)
- On the dimer problem of the vertex-edge graph of a cubic graph (Q6041554) (← links)
- Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest (Q6047972) (← links)
- Combinatorial explanation of the weighted Laplacian characteristic polynomial of a graph and applications (Q6096283) (← links)
- Counting spanning trees with a Kekulé structure in linear hexagonal chains (Q6108002) (← links)
- Enumeration of perfect matchings of the middle graph of a graph \(G\) with \(\triangle (G) \leq 4\) (Q6197712) (← links)
- Asymptotic energy of graphs (Q6211125) (← links)
- On the edge reconstruction of the characteristic and permanental polynomials of a simple graph (Q6454646) (← links)
- Enumeration of spanning trees with a perfect matching of hexagonal lattices on the cylinder and Möbius strip (Q6611077) (← links)
