activity
20162023
most citedUnpaired many-to-many disjoint path cover of balanced hypercubes

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

collaborators

10 papers

math.CO2023

Further results on the permanental sums of bicyclic graphs

Tingzeng Wu, Yinggang Bai

Let be a graph, and let be the adjacency matrix of . The permanental polynomial of is defined as . The permanental sum of can be…

math.CO2022

The characterizing properties of (signless) Laplacian permanental polynomials of bicyclic graphs

Tingzeng Wu, Tian Zhou

Let be a graph with vertices, and let and be the Laplacian matrix and signless Laplacian matrix of , respectively. The polynomial $π(L(G);x)={\rm per}(xI-L…

math.GN2022

Some properties of Pre-topological groups

Fucai Lin, Ting Wu, Yufan Xie +1

In this paper, we pose the concepts of pre-topological groups and some generalizations of pre-topological groups. First, we systematically investigate some basic properties of pre-…

math.CO20201 cited

Forcing and anti-forcing polynomials of a polyomino graph

Kai Deng, Huazhong Lü, Tingzeng Wu

The forcing number of a perfect matching in a graph is the smallest number of edges inside that can not be contained in other perfect matchings. The anti-forcing number…

math.CO20201 cited

Unpaired many-to-many disjoint path cover of balanced hypercubes

Huazhong Lü, Tingzeng Wu

The balanced hypercube , a variant of the hypercube, was proposed as a desired interconnection network topology. It is known that is bipartite. Assume that $S=\{s_1,s_…

math.CO2019

Fractional matching preclusion for restricted hypercube-like graphs

Huazhong Lü, Tingzeng Wu

The restricted hypercube-like graphs, variants of the hypercube, were proposed as desired interconnection networks of parallel systems. The matching preclusion number of a graph is…