Jun Ge

collaborators

2 papers

math.CO2020

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 $G = (V, E)$ is a function $f : E \to {1, - 1}$ such that $\sum_{e^{'} \in N [e]} f (e^{'}) \geq 1$ holds for each edge $e\in E…

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…