审稿中和完成待投论文
[2] Sujing Cheng, Jun Ge*, Counting spanning trees with one perfect matching in helicene polygonal chains, (2024), submitted.
[1] Xian'an Jin, Fuji Zhang, Jun Ge, When will the crossing number of an alternating link decreases by two via a crossing change?, (2013), submitted, arXiv:1407.0139.
发表和已录用的论文
2025
[25] Yuanrui Feng, Jun Ge, Douglas B. West, Yan Yang, Some new results on bar visibility of digraphs, 360 (2025), Discrete Appl. Math., 342-352.
2024
[24] Sujing Cheng, Jun Ge*, The number of spanning trees in K_n-chain and ring graphs, Phys. Scr., 99 (2024), 115236.
[23] Helin Gong, Yu Gong, Jun Ge*, The number of spanning trees in K_n-complements of bipartite graphs, J. Algebraic Combin., 60 (2024), 541-554.
[22] Jun Ge*, Yucui Liao, Bohan Zhang, Resistance distances and the Moon type formula of a vertex-weighted complete split graph, Discrete Appl. Math., 359 (2024), 10-15.
2022
[21] Fengming Dong, Jun Ge*, Counting spanning trees in a complete bipartite graph which contain a given spanning forest, J. Graph Theory, 101(1) (2022), 79-94.
[20] Fengming Dong, Jun Ge, Zhangdong Ouyang, Express the number of spanning trees in term of degrees, Appl. Math. Comput., 415 (2022), 126697.
2021
[19] Jun Ge, Effective resistance and spanning trees in the complete bipartite graph plus a matching, Discrete Appl. Math., 305 (2021), 145-153.
[18] Xing Feng, Jun Ge*, A conjecture on the lower bound of the signed edge domination number of 2-connected graphs, Discrete Appl. Math., 302 (2021), 42-45.
[17] Xian'an Jin, Jun Ge*, Xiao-Sheng Cheng, Yuqinq Lin, The number of circles of a maximum state of a plane graph with applications, Acta Math. Appl. Sin. Engl. Ser. 37(2) (2021), 409-420.
[16] Fengming Dong, Jun Ge, Helin Gong, Bo Ning, Zhangdong Ouyang, Eng Guan Tay, Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations, J. Graph Theory, 96 (2021), 343-360.
[15] Fengming Dong, Jun Ge*, Yan Yang, Upper bounds on the signed edge domination number of a graph, Discrete Math., 344(2) (2021), 112201.
2020
[14] Jun Ge*, Fengming Dong, Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs, Discrete Appl. Math., 283 (2020), 542-554.
[13] Jun Ge, Bo Ning, Spectral radius and Hamiltonian properties of graphs, II, Linear Multilinear Algebra, 68(11) (2020), 2298-2315.
2019
[12] Zhangdong Ouyang, Jun Ge, Yichao Chen, Remarks on the Joins of 1-Planar Graphs, Appl. Math. Comput., 362 (2019), 124537.
[11] Shuli Li*, Jun Ge*, Sharp upper bounds for the F-index of bipartite graphs with a given diameter, Ars Combinatoria 146 (2019), 143-155.
2018
[10] Jun Ge*, Xian'an Jin, Louis H. Kauffman, Pedro Lopes, Lianzhu Zhang, Answer to a question by Nakamura, Nakanishi, and Satoh involving crossing numbers of knots, Osaka J. Math. 55(3) (2018), 523-527.
2017
[9] Jun Ge*, Xian'an Jin, Louis H. Kauffman, Pedro Lopes, Lianzhu Zhang, Minimal sufficient sets of colors and minimum number of colors, J. Knot Theory Ramifications 26(9) (2017), 1743008.
2016
[8] Jun Ge*, Lianzhu Zhang, Determinant of links, spanning trees, and a theorem of Shank, J. Knot Theory Ramifications 25(9) (2016), 1641005.
[7] Bo Ning, Jun Ge*, Rainbow C_4's and directed C_4's: the bipartite case study, Bull. Malays. Math. Sci. Soc. 39(2) (2016), 563-570.
2015
[6] 戈鋆, 排叉链环的行列式, 厦门大学学报: 自然科学版, 2015, 54(6), 843-845.
[5] Bo Ning, Jun Ge, Spectral radius and Hamiltonian properties of graphs, Linear Multilinear Algebra 63(8) (2015), 1520-1530.
2014
[4] Jun Ge, Slavik Jablan, Louis H. Kauffman, Pedro Lopes, Equivalence classes of colorings, in Knots in Poland III, Part III, Warsaw-Bedlewo, Banach Center Publications 103 (2014), 63-76.
2013
[3] Jun Ge*, Xian'an Jin, The Homfly polynomial of classical pretzel links and its application to chirality, J. Knot Theory Ramifications 22(13) (2013), 1350076.
2009
[2] Yiming Sun, Zuoming Yu, Jun Ge, Bin Lin, Ziqiu Yun, On deploying wireless sensors to achieve both coverage and connectivity, WICOM'09 Proceedings of the 5th International Conference on wireless communications, networking and mobile computing, (2009) 3369-3372. (EI)
2008
[1] 戈鋆, Eisenstein判别法的推广, 数学教学通讯, 2008(2), 64.