7 papers
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…
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…
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.…
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 ,…
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…
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…