activity
20172026
most citedThe Minimal Coloring Number Of Any Non-splittable -colorable Link Is Four

2 citations · 3 across the 18 of their papers we have counts for

collaborators

18 papers

math.CO2026

A Characterization of Trees with Trinomial Partial Petrial Polynomials

Qingying Deng, Chaoyang Zhang

The partial Petrial polynomial of a bouquet can be computed from the coranks over GF(2) of matrices obtained by varying the diagonal entries of the adjacency matrix of its intersec…

math.CO2026

Partial-twuality polynomials of matrices

Qingying Deng, Xian'an Jin, Qi Yan

The study of partial-twuality polynomials originates from the classical operations of geometric duality and Petrie duality on cellularly embedded graphs. These involutions generate…

math.CO2025

Matrix Quasi-tree Theorem

Qingying Deng, Xian'an Jin, Qi Yan +1

Building on prior work that established Matrix Quasi-tree Theorems for special embedded graphs, in this paper, we develop a comprehensive theory applicable to all embedded graphs.…

math.CO2025

Proof of a conjecture of Fomichev and Karev

Qi Yan, Qingying Deng, Xian'an Jin

We prove a conjecture of Fomichev and Karev [{European J. Combin.} 127 (2025) 104160] by showing the equality of two graph invariants: , defined via graph colorings, and , de…

math.CO2025

Introducing a vertex polynomial invariant for embedded graphs

Qi Yan, Qingying Deng, Metrose Metsidik

The ribbon group action extends geometric duality and Petrie duality by defining two embedded graphs as twisted duals precisely when they lie within the same orbit under this group…

math.CO2024

Hamiltonian Properties of Hybrid-Faulty Burnt Pancake Graphs

Hongyi Zhu, Qingying Deng

We investigate the combined occurrence of edge faults and vertex faults in the burnt pancake graph (\( BP_n \)). In this paper, we prove that \( BP_n - F \), where \( F \) includes…

math.GT2024

Thistlethwaite Theorems for Knotoids and Linkoids

Sergei Chmutov, Qingying Deng, Joanna A. Ellis-Monaghan +2

The classical Thistlethwaite theorem for links can be phrased as asserting that the Kauffman bracket of a link can be obtained from an evaluation of the Bollobás-Riordan polynomial…

math.CO2024

The number of quasi-trees of bouquets with exactly one non-orientable loop

Qingying Deng, Xian'an Jin, Qi Yan

Recently, Merino extended the classical relation between the -th Fibonacci number and the number of spanning trees of the -fan graph to ribbon graphs, and established a rela…

math.CO2024

Twist polynomial as a weight system for set systems

Qingying Deng, Xian'an Jin, Qi Yan

Recently, Chmutov proved that the partial-dual polynomial considered as a function on chord diagrams satisfies the four-term relation. Deng et al. then proved that this function on…

math.CO2024★ 1 cited

Partial-dual polynomial as a framed weight system

Qingying Deng, Fengming Dong, Xian'an Jin +1

Recently, Chmutov proved that the partial-dual polynomial considered as a function on chord diagrams satisfies the four-term relations. In this paper, we show that this function on…

math.GT2021

Unknotting twisted knots with Gauss diagram forbidden moves

Shudan Xue, Qingying Deng

Twisted knot theory, introduced by M.O.Bourgoin, is a generalization of virtual knot theory. It is easily shown that any virtual knot can be deformed into a trivial knot by a finit…

math.GT2021

One conjecture on cut points of virtual links and the arrow polynomial of twisted links

Qingying Deng

Checkerboard framings are an extension of checkerboard colorings for virtual links. According to checkerboard framings, in 2017, Dye obtained an independent invariant of virtual li…

math.GT2021

Projectors in the Virtual Temperley-Lieb Algebra

Qingying Deng, Xian'an Jin, Louis H. Kauffman

We present a method of defining projectors in the virtual Temperley-Lieb algebra, that generalizes the Jones-Wenzl projectors in Temperley-Lieb algebra. We show that the projectors…

math.GT2020

On arrow polynomials of checkerboard colorable virtual links

Qingying Deng, Xian'an Jin, Louis H. Kauffman

In this paper we give two new criteria of detecting the checkerboard colorability of virtual links by using odd writhe and arrow polynomial of virtual links, respectively. By apply…

math.GT2018

The generalized Yamada polynomials of virtual spatial graphs

Qingying Deng, Xian'an Jin, Louis H. Kauffman

Classical knot theory can be generalized to virtual knot theory and spatial graph theory. In 2007, Fleming and Mellor combined virtual knot theory and spatial graph theory to form,…

math.GT2017

Graphical virtual links and a polynomial of signed cyclic graphs

Qingying Deng, Xian'an Jin, Louis H Kauffman

For a signed cyclic graph G, we can construct a unique virtual link L by taking the medial construction and convert 4-valent vertices of the medial graph to crossings according to…

math.GT2017★ 2 cited

The Minimal Coloring Number Of Any Non-splittable -colorable Link Is Four

Meiqiao Zhang, Xian'an Jin, Qingying Deng

K. Ichihara and E. Matsudo introduced the notions of -colorable links and the minimal coloring number for -colorable links, which is one of invariants for l…

math.CO2017

Characterizations of Eulerian and even-face partial duals of ribbon graphs

Qingying Deng, Xian'an Jin

Huggett and Moffatt characterized all bipartite partial duals of a plane graph in terms of all-crossing directions of its medial graph. Then Metsidik and Jin characterized all Eule…