1 citations · 2 across the 4 of their papers we have counts for
10 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…
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…