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 2019Show all

4 papers · 1 filter

math.CO2019

New expressions for order polynomials and chromatic polynomials

Fengming Dong

Let $G = (V, E)$ be a simple graph with $V = {1, 2, \dots, n}$ and $χ (G, x)$ be its chromatic polynomial. For an ordering $π = (v_{1}, v_{2}, \dots, v_{n})$ of elements of $V$ , let $δ_{G} (π)$ be the…

math.CO2019

The rank of a complex unit gain graph in terms of the matching number

Shengjie He, Rong-Xia Hao, Fengming Dong

A complex unit gain graph (or $T$ -gain graph) is a triple $Φ = (G, T, φ)$ (or $(G, φ)$ for short) consisting of a simple graph $G$ , as the underlying graph of $(G…

math.CO2019

Formulas counting spanning trees in line graphs and their extensions

Fengming Dong

For any connected multigraph $G = (V, E)$ and any $M \subseteq E$ , if $M$ induces an acyclic subgraph of $G$ and removing all edges in $M$ yields a subgraph of $G$ whose components are…

math.CO2019

Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs

Jun Ge, Fengming Dong

Using the theory of electrical network, we first obtain a simple formula for the number of spanning trees of a complete bipartite graph containing a certain matching or a certain t…