Huazhong Lü

Learn More
The balanced hypercube, proposed by Wu and Huang, is a new variation of hypercube. The particular property of the balanced hypercube is that each processor has a backup processor that shares the same neighborhood. A Hamiltonian bipartite graph with bipartition $$V_{0}\cup V_{1}$$ V 0 ∪ V 1 is said to be Hamiltonian laceable if there is a Hamiltonian path(More)
Matching preclusion is a measure of robustness in the event of edge failure in interconnection networks. The matching preclusion number of a graph G is the minimum number of edges whose deletion leaves the resulting graph without a perfect matching or an almost perfect matching, and the conditional matching preclusion number of G is the minimum number of(More)
Principal Component Analysis (PCA) is one of the main methods used for electronic nose pattern recognition. However, poor classification performance is common in classification and recognition when using regular PCA. This paper aims to improve the classification performance of regular PCA based on the existing Wilks Λ-statistic (i.e., combined PCA with the(More)
The brown rice plant hopper (BRPH), Nilaparvata lugens (Stal), is one of the most important insect pests affecting rice and causes serious damage to the yield and quality of rice plants in Asia. This study used bionic electronic nose technology to sample BRPH volatiles, which vary in age and amount. Principal component analysis (PCA), linear discrimination(More)
The purpose of this paper was to explore the utility of an electronic nose to detect the quality of litchi fruit stored in different environments. In this study, a PEN3 electronic nose was adopted to test the storage time and hardness of litchi that were stored in three different types of environment (room temperature, refrigerator and(More)
Anti-Kekulé problem is a concept of chemical graph theory precluding the Kekulé structure of molecules. Matching preclusion and conditional matching preclusion were proposed as measures of robustness in the event of edge failure in interconnection networks. It is known that matching preclusion problem on bipartite graphs is NP-complete. In this paper, we(More)
  • 1