65 citations · 120 across the 12 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
math.CO2021
Some new results on bar visibility of digraphs
Yuanrui Feng, Jun Ge, Douglas B. West +1
Visibility representation of digraphs was introduced by Axenovich, Beveridge, Hutch\-inson, and West (\emph{SIAM J. Discrete Math.} {\bf 27}(3) (2013) 1429--1449) as a natural gene…
math.CO2021
Express the number of spanning trees in term of degrees
Fengming Dong, Jun Ge, Zhangdong Ouyang
It is well-known that the number of spanning trees, denoted by , in a connected multi-graph can be calculated by the Matrix-Tree theorem and Tutte's deletion-contraction…
math.CO2021★ 22 cited
Counting spanning trees in a complete bipartite graph which contain a given spanning forest
Fengming Dong, Jun Ge
In this article, we extend Moon's classic formula for counting spanning trees in complete graphs containing a fixed spanning forest to complete bipartite graphs. Let be the…