9 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
9 papers
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…
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…
Extreme tenacity of graphs with given order and size
T. C. E. Cheng, Yinkui Li, Chuandong Xu +1
Computer or communication networks are so designed that they do not easily get disrupted under external attack and, moreover, these are easily reconstructible if they do get disrup…