Weigen Yan

activity

20052026

most citedEnumeration of subtrees of trees

72 citations · 163 across the 16 of their papers we have counts for

collaborators

16 papers

math.CO2026

Chvátal-Erdős condition for 2-factors with at most two components in graphs

Tao Tian, Liming Xiong, Weigen Yan

It is well-known that Chvátal and Erdős stated that any graph of order at least three whose independence number is no greater than its connectivity is Hamiltonian; that any graph w…

math.CO2023

On the edge reconstruction of six digraph polynomials

Jingyuan Zhang, Xian'an Jin, Weigen Yan

Let $G = (V, E)$ be a digraph having no loops and no multiple arcs, with vertex set $V = {v_{1}, v_{2}, \dots, v_{n}}$ and arc set $E = {e_{1}, e_{2}, \dots, e_{m}}$ . Denote the adjacency matrix and…

math.CO2021

Enumeration of spanning trees of middle graphs

Xuemei Chen, Xian'an Jin, Weigen Yan

Let $D$ be a connected weighted digraph. The relation between the vertex weighted complexity (with a fixed root) of the line digraph of $D$ and the edge weighted complexity (with a…

math.CO2021

Solving the dimer problem of the vertex-edge graph of a cubic graph

Shuli Li, Weigen Yan, Danyi Li

Let $G$ be a graph with vertex set $V (G)$ and edge set $E (G)$ , and $L (G)$ be the line graph of $G$ , which has vertex set $E (G)$ and two vertices $e$ and $f$ of $L (G)$ is adjacent i…

math.CO2021

The super-connectivity of Kneser graph KG(n,3)

Yulan Chen, Yuqing Lin, Weigen Yan

A vertex cut $S$ of a connected graph $G$ is a subset of vertices of $G$ whose deletion makes $G$ disconnected. A super vertex cut $S$ of a connected graph $G$ is a subset of verti…

math.CO2015★ 36 cited

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

Fengming Dong, Weigen Yan

For any graph $G$ , let $t (G)$ be the number of spanning trees of $G$ , $L (G)$ be the line graph of $G$ and for any non-negative integer $r$ , $S_{r} (G)$ be the graph obtained from $G$ …