4 papers · 1 filter
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…
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…
Upper bounds on the signed edge domination number of a graph
Fengming Dong, Jun Ge, Yan Yang
A signed edge domination function (or SEDF) of a simple graph is a function such that holds for each edge $e\in E…
Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations
Fengming Dong, Jun Ge, Helin Gong +3
The chromatic polynomial of a graph of order can be expressed as , where is interpreted as the number of broken-cycle…