The following pages link to Weigen Yan (Q315679):
Displaying 50 items.
- The spectrum and Laplacian spectrum of the dice lattice (Q315681) (← links)
- The asymptotic behavior of some indices of iterated line graphs of regular graphs (Q423938) (← links)
- Kekulé structures of polyomino chains and the Hosoya index of caterpillar trees (Q442334) (← links)
- Dimers belonging to three orientations on plane honeycomb lattices (Q658482) (← links)
- Extremal matching energy of complements of trees (Q726630) (← links)
- The matching energy of graphs with given parameters (Q741776) (← links)
- Maximal energy of subdivisions of graphs with a fixed chromatic number (Q745924) (← links)
- On the minimal energy of trees with a given diameter (Q812656) (← links)
- Graphical condensation of plane graphs: a combinatorial approach (Q817820) (← links)
- On the nullity and the matching number of unicyclic graphs (Q837008) (← links)
- Enumeration of subtrees of trees (Q861266) (← links)
- On the number of matchings of graphs formed by a graph operation (Q867792) (← links)
- On the matching polynomial of subdivision graphs (Q1003776) (← links)
- Enumerating spanning trees of graphs with an involution (Q1024367) (← links)
- Heredity of the index of convergence of the line digraph (Q1414247) (← links)
- Dimers on the \(3^3 . 4^2\) lattice (Q1619468) (← links)
- Monomer-dimer problem on some networks (Q1619615) (← links)
- The triangular kagomé lattices revisited (Q1673308) (← links)
- Resistance between two vertices of almost complete bipartite graphs (Q1730251) (← links)
- Enumeration of spanning trees of middle graphs (Q1736137) (← links)
- Graphical condensation for enumerating perfect matchings (Q1775549) (← links)
- Some two-point resistances of the Sierpinski gasket network (Q1785685) (← links)
- On the permanental polynomials of some graphs (Q1878855) (← links)
- Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians (Q1883410) (← links)
- On the number of perfect matchings of line graphs (Q1946221) (← links)
- On the Kirchhoff index of a unicyclic graph and the matchings of the subdivision (Q2030242) (← links)
- Counting spanning trees in almost complete multipartite graphs (Q2082527) (← links)
- Combinatorial explanation of coefficients of the Laplacian matching polynomial of graphs (Q2113369) (← links)
- Solving combinatorially the monomer-dimer problem on certain fractal scale-free lattices (Q2122766) (← links)
- Counting spanning trees of a type of generalized Farey graphs (Q2139695) (← links)
- On eigenvalues and the energy of dendrimer trees (Q2139759) (← links)
- Resistance between two nodes of a ring network (Q2147735) (← links)
- Enumeration of spanning trees of 2-separable networks (Q2164266) (← links)
- A type of generalized mesh-star transformation and applications in electrical networks (Q2166234) (← links)
- Using edge generating function to solve monomer-dimer problem (Q2221757) (← links)
- Resistance distances in vertex-weighted complete multipartite graphs (Q2244156) (← links)
- Resistances between two nodes of a path network (Q2279579) (← links)
- Spanning trees and dimer problem on the Cairo pentagonal lattice (Q2335635) (← links)
- On the number of spanning trees of some irregular line graphs (Q2349194) (← links)
- The behavior of Wiener indices and polynomials of graphs under five graph decorations (Q2371135) (← links)
- A quadratic identity for the number of perfect matchings of plane graphs (Q2378519) (← links)
- Replacing Pfaffians and applications (Q2383534) (← links)
- Generalized Wiener indices of zigzagging pentachains (Q2385376) (← links)
- The coefficients of Laplacian characteristic polynomials of graphs (Q2427934) (← links)
- Laplacian coefficients of trees with a given bipartition (Q2431179) (← links)
- Enumeration of spanning trees of graphs with rotational symmetry (Q2431603) (← links)
- The determinants of \(q\)-distance matrices of trees and two quantities relating to permutations (Q2465831) (← links)
- A simple proof of Graham and Pollak's theorem (Q2497973) (← links)
- Connections between Wiener index and matchings (Q2503738) (← links)
- The number of spanning trees of plane graphs with reflective symmetry (Q2568971) (← links)