activity
20232026
most citedOn the classification and dispersability of circulant graphs with two jump lengths

1 citations · 1 across the 5 of their papers we have counts for

collaborators

6 papers

math.CO2026

Partial-Twuality Polynomials of Paired Matrices

Xiaoxiang Yu, Rong-Xia Hao, Jianbing Liu

Gross, Mansour, and Tucker~[European Journal of Combinatorics, 95 (2021): 103329] introduced the \emph{partial-twuality polynomials} of ribbon graphs. Recently, Deng, Jin, and Yan…

math.CO2026

Partial Petrial Polynomials of Bouquets

Xiaoxiang Yu, Rong-Xia Hao, Jianbing Liu +1

Gross, Mansour, and Tucker [European J. Combin., 95 (2021): 103329] introduced the \emph{partial Petrial polynomial} of a ribbon graph , denoted by $^{\partial}{\varepsilon^{\ti…

math.CO2026

Partial Petrial Polynomials of Ribbon Graphs

Xiaoxiang Yu, Rong-Xia Hao, Jianbing Liu +1

Gross, Mansour, and Tucker [European J. Combin., 95 (2021): 103329] introduced the \emph{partial Petrial polynomial} of a ribbon graph , denoted by $^{\partial}{\varepsilon^{\ti…

math.CO2024

A note on the Nearly Dispersability of Odd Toroidal Grids

Xiaoxiang Yu, Zeling Shao, Zhiguo Li

The \emph{matching book thickness} of is the minimum integer such that an -page matching book embedding exists. A graph is called \emph{dispersable} if $mbt…

math.CO2024

On the dispersability of graph bundles over cycles

Zeling Shao, Xiaoxiang Yu, Zhiguo Li

In this paper, the dispersability of the Cartesian graph bundle over two cycles is completely solved. We show the Cartesian graph bundle over two cycles is dispersable if i…

math.CO2023★ 1 cited

On the classification and dispersability of circulant graphs with two jump lengths

Xiaoxiang Yu, Zeling Shao, Zhiguo Li

In this paper, we give the classification of circulant graphs with and completely solve the dispersability of circulant graphs $C(\mathbb{Z}_{n},\{1,…