Fuji Zhang

activity

20052021

most citedThe maximum forcing number of polyomino

3 citations · 8 across the 9 of their papers we have counts for

collaborators

9 papers

math.CO2021

Tutte polynomials of fan-like graphs with applications in benzenoid systems

Tianlong Ma, Xian'an Jin, Fuji Zhang

We study the computation of the Tutte polynomials of fan-like graphs and obtain expressions of their Tutte polynomials via generating functions. As applications, Tutte polynomials,…

math.CO2017

Flip-distance between α-orientations of graphs embedded on plane and sphere

Weijuan Zhang, Jianguo Qian, Fuji Zhang

Felsner introduced a cycle reversal, namely the `flip' reversal, for α-orientations (i.e., each vertex admits a prescribed out-degree) of a graph G embedded on the plane and furthe…

math.CO2014★ 3 cited

The maximum forcing number of polyomino

Liqiong Xu, Yuqing Lin, Fuji Zhang

The forcing number of a perfect matching $M$ of a graph $G$ is the cardinality of the smallest subset of $M$ that is contained in no other perfect matchings of $G$ . For a planar em…

math.GT2014★ 1 cited

When will the crossing number of an alternating link decrease by two via a crossing change?

Xian'an Jin, Fuji Zhang, Jun Ge

Let $D$ be a reduced alternating diagram of a non-split link $L$ and $L ~$ be the link whose diagram is obtained from $D$ by a crossing change. If $L ~$ is alternating,…

math.CO2009★ 1 cited

Perfect matchings of line graphs with small maximum degree

Weigen Yan, Fuji Zhang

Let $G$ be a connected graph with vertex set $V (G) = {v_{1}, v_{2}, ..., v_{ν}}$ , which may have multiple edges but have no loops, and $2 \leq d_{G} (v_{i}) \leq 3$ for $i = 1, 2, ..., ν$ , where $d_G(v…

math.CO2006★ 1 cited

Matchings and entropies of cylinders

Weigen Yan, Yeong-Nan Yeh, Fuji Zhang

The enumeration of perfect matchings of graphs is equivalent to the dimer problem which has applications in statistical physics. A graph $G$ is said to be $n$ -rotation symmetric if…