9 citations · 20 across the 15 of their papers we have counts for
15 papers
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…
Enumeration of maximum matchings of graphs
Tingzeng Wu, Xiaolin Zeng, Huazhong Lv
Counting maximum matchings in a graph is of great interest in statistical mechanics, solid-state chemistry, theoretical computer science, mathematics, among other disciplines. Howe…
Free weighted differential (-tri)dendriform algebras
Yuanyuan Zhang, Huhu Zhang, Tingzeng Wu +1
In the present paper, we propose the concepts of weighted differential (-tri)dendriform algebras and give some basic properties of them. The corresponding free objects are const…
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…
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-…
On complexity of substructure connectivity and restricted connectivity of graphs
Huazhong Lü, Tingzeng Wu
The connectivity of a graph is an important parameter to evaluate its reliability. -restricted connectivity (resp. -restricted connectivity) of a graph is the minimum c…
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…
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_…
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…
On the conjecture of bijection between perfect matching and sub-hypercube in folded hypercubes
Huazhong Lü, Tingzeng Wu
Dong and Wang in [Theor. Comput. Sci. 771 (2019) 93--98] conjectured that the resulting graph of the -dimensional folded hypercube by deleting any perfect matching is iso…
Structure and substructure connectivity of balanced hypercubes
Huazhong Lü, Tingzeng Wu
The connectivity of a network directly signifies its reliability and fault-tolerance. Structure and substructure connectivity are two novel generalizations of the connectivity. Let…
Super edge-connectivity and matching preclusion of data center networks
Huazhong Lü, Tingzeng Wu
Edge-connectivity is a classic measure for reliability of a network in the presence of edge failures. -restricted edge-connectivity is one of the refined indicators for fault to…
The restricted -connectivity of balanced hypercubes
Huazhong Lü, Tingzeng Wu
The restricted -connectivity of a graph , denoted by , is defined as the minimum cardinality of a set of vertices in , if exists, whose removal disconnects …
On the permanental nullity and matching number of graphs
Tingzeng Wu, Hong-Jian Lai
For a graph with vertices, let and denote the matching number and adjacency matrix of , respectively. The permanental polynomial of is defined as $π(G,…
Extremal matching energy of complements of trees
Tingzeng Wu, Weigen Yan, Heping Zhang
The matching energy is defined as the sum of the absolute values of the zeros of the matching polynomial of a graph, which is proposed first by Gutman and Wagner [The matching ener…