9 citations · 22 across the 14 of their papers we have counts for
15 papers
Paired many-to-many 2-disjoint path cover of Johnson graphs
Jinhao Liu, Huazhong Lü
Given two 2 disjoint vertex-sets and , a paired many-to-many 2-disjoint path cover joining S and T, is a set of two vertex-disjoint paths with endpoints $u,v…
Brualdi-Goldwasser-Michael problem for maximum permanents of {\rm(0,1)}-matrices
Tingzeng Wu, Xiangshuai Dong, Huazhong Lü
Let be the set of all {\rm(0,1)}-matrices of order with exactly 0's. Brualdi et al. investigated the maximum permanents of all matrices in $\mathscr{U}(n…
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…
Hamiltonian cycles of balanced hypercube with more faulty edges
Ting Lan, Huazhong Lü
The balanced hypercube , a variant of the hypercube, is a novel interconnection network for massive parallel systems. It is known that the balanced hypercube remains Hamilt…
Symmetric properties and two variants of shuffle-cubes
Huazhong Lü, Kai Deng, Xiaomei Yang
Li et al. in [Inf. Process. Lett. 77 (2001) 35--41] proposed the shuffle cube as an attractive interconnection network topology for massive parallel and distributed system…
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 conjecture of vertex-transitivity of Dcell
Huazhong Lü
Gu et al. in [Inform. Process. Lett. 134 (2018) 52--56] conjectured that the data center network is vertex-transitive for all and . In this paper, we sho…
Paired many-to-many 2-disjoint path cover of balanced hypercubes with faulty edges
Huazhong Lü
As a variant of the well-known hypercube, the balanced hypercube was proposed as a novel interconnection network topology for parallel computing. It is known that is…