Xiumei Wang

collaborators

4 papers

math.CO2026

On graphs with $1$ -matching and $2$ -matching edges

Yixuan Gao, Xiumei Wang, Jinfeng Liu

Let $G$ be a graph admitting a perfect matching. An edge is called a {\it $k$-matching edge} if it belongs to exactly $k$ perfect matchings, and a {\it $k^{+}$-matching edg…

math.CO2025

The spectral radii and extremal graphs of two types of minimal graphs

Liwen Lian, Jinfeng Liu, Mengyuan Niu +1

A connected nontrivial graph $G$ is {\it matching covered} if every edge of $G$ is contained in some perfect matching of $G$ . A matching covered graph $G$ is {\it minimal} if $G - e$ …

math.CO2025

Claw-free bricks that every $b$ -invariant edge is solitary

Yipei Zhang, Xiumei Wang

A graph $G$ is a brick if it is 3-connected and $G - {u, v}$ has a perfect matching for any two distinct vertices $u$ and $v$ of $G$ . Lucchesi and Murty proposed a problem concernin…

math.CO2025

Solid bricks that every $b$ -invariant edge is solitary

Yipei Zhang, Xiumei Wang

A graph $G$ is a brick if it is 3-connected and $G - {u, v}$ has a perfect matching for any two distinct vertices $u$ and $v$ of $G$ . A brick $G$ is solid if for any two vertex disj…

On graphs with 1-matching and 2-matching edges

The spectral radii and extremal graphs of two types of minimal graphs

Claw-free bricks that every b-invariant edge is solitary

Solid bricks that every b-invariant edge is solitary

On graphs with $1$ -matching and $2$ -matching edges

Claw-free bricks that every $b$ -invariant edge is solitary

Solid bricks that every $b$ -invariant edge is solitary