F. Dong

activity

20152023

most citedExpression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs

36 citations · 70 across the 26 of their papers we have counts for

collaborators

Showing 2018Show all

4 papers · 1 filter

math.CO2018★ 1 cited

On non-feasible edge sets in matching-covered graphs

Xiao Zhao, Fengming Dong, Sheng Chen

Let $G = (V, E)$ be a matching-covered graph and $X$ be an edge set of $G$ . $X$ is said to be feasible if there exist two perfect matchings $M_{1}$ and $M_{2}$ in $G$ such that $|M_1\cap…

math.CO2018

Zero-free intervals of chromatic polynomials of mixed hypergraphs

Ruixue Zhang, Fengming Dong

In this paper, we prove that $(- \infty, 0)$ is a zero-free interval for chromatic polynomials of a family $L_{0}$ of hypergraphs and $(0, 1)$ is a zero-free interval for chrom…

math.CO2018★ 1 cited

On graphs whose flow polynomials have real roots only

Fengming Dong

Let $G$ be a bridgeless graph. In 2011 Kung and Royle showed that all roots of the flow polynomial $F (G, λ)$ of $G$ are integers if and only if $G$ is the dual of a chordal and plan…

math.CO2018

Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations

Fengming Dong, Jun Ge, Helin Gong +3

The chromatic polynomial $P (G, x)$ of a graph $G$ of order $n$ can be expressed as $i = 1 \sum n (- 1)^{n - i} a_{i} x^{i}$ , where $a_{i}$ is interpreted as the number of broken-cycle…