65 citations · 120 across the 12 of their papers we have counts for
13 papers
Bricks that every removable edge is solitary
Jinxin Xue, Jun Ge, Fuliang Lu +1
A brick is a 3-connected graph such that has a perfect matching for any two distinct vertices . An edge in a matching covered graph is removable if…
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…
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…
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…
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…
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…
Spectral radius and Hamiltonian properties of graphs, II
Jun Ge, Bo Ning
In this paper, we first present spectral conditions for the existence of in graphs (2-connected graphs) of order , which are motivated by a conjecture of Erdős. Then w…
Minimal sufficient sets of colors and minimum number of colors
Jun Ge, Xian'an Jin, Louis H. Kauffman +2
In this paper we first investigate minimal sufficient sets of colors for p=11 and 13. For odd prime p and any p-colorable link L with non-zero determinant, we give alternative proo…
When will the crossing number of an alternating link decrease by two via a crossing change?
Xian'an Jin, Fuji Zhang, Jun Ge
Let be a reduced alternating diagram of a non-split link and be the link whose diagram is obtained from by a crossing change. If is alternating,…
Spectral radius and Hamiltonian properties of graphs
Bo Ning, Jun Ge
Let be a graph with minimum degree . The spectral radius of , denoted by , is the largest eigenvalue of the adjacency matrix of . In this note we mainly prove th…
Rainbow C_4's and Directed C_4's: the Bipartite Case Study
Bo Ning, Jun Ge
In this paper we obtain a new sufficient condition for the existence of directed cycles of length 4 in oriented bipartite graphs. As a corollary, a conjecture of H. Li is confirmed…
Equivalence Classes of Colorings
Jun Ge, Slavik Jablan, Louis H. Kauffman +1
For any link and for any modulus we introduce an equivalence relation on the set of non-trivial m-colorings of the link (an m-coloring has values in Z/mZ). Given a diagram of t…