Huazhong Lü
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Huazhong Lü has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Tingzeng Wu
School of Mathematics and Statistics, Qinghai Minzu University, Xining, China
14 shared publications Tingzeng Wu
5 shared publications- Heping Zhang
School of Mathematics and Statistics Lanzhou University Lanzhou China
4 shared publications Ting Lan
Univ Elect Sci & Technol China, Sch Math Sci, Chengdu 610054, Sichuan, Peoples R China
2 shared publications- Xianyue Li
School of Mathematics and Statistics, Qinghai Minzu University, Xining, China
2 shared publications - Xiaolin Zeng
Université de Strasbourg, Strasbourg, France
2 shared publications
Latest Publications
- 6 November 2026
- Published by World Scientific Pub Co Pte Ltd in Journal of Interconnection Networks
Paired Many-to-Many 2-Disjoint Path Cover of Johnson Graphs
Given two disjoint vertex-sets [Formula: see text] and [Formula: see text], a paired many-to-many 2-disjoint path cover joining [Formula: see text] and [Formula: see text] is a set of two vertex-disjoint paths with endpoints [Formula: see text] and [Formula: see text], respectively, that cover every vertex of the graph. If a graph has such a cover for any two disjoint vertex-sets [Formula: see text] and [Formula: see text], then it is called paired 2-coverable. It is straightforward that every paired 2-coverable graph is Hamilton-connected, whereas the converse does not hold in general. Alspach [Johnson graphs are Hamilton-connected, Ars Math. Contemp. 6 (2013) 21–23] proved that Johnson graphs [Formula: see text], where [Formula: see text], are Hamilton-connected. In this paper, we prove that Johnson graphs are paired 2-coverable. Moreover, we show that another family of graphs [Formula: see text], constructed from Johnson graphs by Alspach, is also paired 2-coverable.
- 6 November 2026
- Published by World Scientific Pub Co Pte Ltd in Journal of Interconnection Networks
Paired Many-to-Many 2-Disjoint Path Cover of Johnson Graphs
Given two disjoint vertex-sets [Formula: see text] and [Formula: see text], a paired many-to-many 2-disjoint path cover joining [Formula: see text] and [Formula: see text] is a set of two vertex-disjoint paths with endpoints [Formula: see text] and [Formula: see text], respectively, that cover every vertex of the graph. If a graph has such a cover for any two disjoint vertex-sets [Formula: see text] and [Formula: see text], then it is called paired 2-coverable. It is straightforward that every paired 2-coverable graph is Hamilton-connected, whereas the converse does not hold in general. Alspach [Johnson graphs are Hamilton-connected, Ars Math. Contemp. 6 (2013) 21–23] proved that Johnson graphs [Formula: see text], where [Formula: see text], are Hamilton-connected. In this paper, we prove that Johnson graphs are paired 2-coverable. Moreover, we show that another family of graphs [Formula: see text], constructed from Johnson graphs by Alspach, is also paired 2-coverable.
- 11 August 2026
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 532
Brualdi-Goldwasser-Michael problem for maximum permanents of (0,1)-matrices
- 11 August 2026
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 532
Brualdi-Goldwasser-Michael problem for maximum permanents of (0,1)-matrices
- 5 February 2026
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 211
On complexity of substructure connectivity and restricted connectivity of graphs
- 5 February 2026
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 211
On complexity of substructure connectivity and restricted connectivity of graphs
- 20 November 2025
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 381, 71-79
Hamiltonian cycle and path of folded hypercube with faulty matchings
- 20 November 2025
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 381, 71-79
Hamiltonian cycle and path of folded hypercube with faulty matchings
- Open Access
Paired many-to-many 2-disjoint path cover of Johnson graphs
Given two 2 disjoint vertex-sets $S=\{u,x\}$ and $T=\{v,y\}$, 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$ and $x,y$, respectively, that cover every vertex of the graph. If the graph has a many-to-many 2-disjoint path cover for any two disjoint vertex-sets $S$ and $T$, then it is called paired 2-coverable. It is known that if a graph is paired 2-coverable, then it must be Hamilton-connected, but the reverse is not true. It has been proved that Johnson graphs $J(n,k)$, $0\le k\le n$, are Hamilton-connected by Brian Alspach in [Ars Math. Contemp. 6 (2013) 21--23]. In this paper, we prove that Johnson graphs are paired 2-coverable. Moreover, we obtain that another family of graphs $QJ(n,k)$ constructed from Johnson graphs by Alspach are also paired 2-coverable.Open AccessPaired many-to-many 2-disjoint path cover of Johnson graphs
Given two 2 disjoint vertex-sets $S=\{u,x\}$ and $T=\{v,y\}$, 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$ and $x,y$, respectively, that cover every vertex of the graph. If the graph has a many-to-many 2-disjoint path cover for any two disjoint vertex-sets $S$ and $T$, then it is called paired 2-coverable. It is known that if a graph is paired 2-coverable, then it must be Hamilton-connected, but the reverse is not true. It has been proved that Johnson graphs $J(n,k)$, $0\le k\le n$, are Hamilton-connected by Brian Alspach in [Ars Math. Contemp. 6 (2013) 21--23]. In this paper, we prove that Johnson graphs are paired 2-coverable. Moreover, we obtain that another family of graphs $QJ(n,k)$ constructed from Johnson graphs by Alspach are also paired 2-coverable. - 8 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 36 (6) , 1282-1293
Symmetric Properties and Two Variants of Shuffle-Cubes
Li et al. in [Inf. Process. Lett. 77 (2001) 35–41] proposed the shuffle-cube$SQ_{n}$ , a hypercube variant, as an attractive interconnection network topology for massive parallel and distributed systems. Diameter and symmetry are two desirable measures of network performance in terms of transmission delay and routing algorithms. Almost all$n$ -regular hypercube variants of dimension$n$ have diameter not less than$n/2$ . The diameter of the shuffle-cube is approximately a quarter of the diameter of the hypercube of the same dimension, making it a competitive candidate network topology. By far, symmetric properties of the shuffle-cube remain unknown. In this paper, we show that$SQ_{n}$ is not vertex-transitive for$n> 2$ , which is not an appealing property in interconnection networks. This shortcoming limits the practical application of the shuffle-cube. To overcome this limitation, two novel variants of the shuffle-cube, namely simplified shuffle-cube$SSQ_{n}$ and balanced shuffle-cube$BSQ_{n}$ are introduced, and their vertex-transitivity are proved simultaneously. By proposing the shuffle-cube-like graph, we obtain that both$SSQ_{n}$ and$BSQ_{n}$ are maximally connected, implying high connectivity similar to the hypercube. Additionally, super-connectivity, a refined parameter of connectivity, of$SSQ_{n}$ and$BSQ_{n}$ are also determined. Then, by vertex-transitivity of$SSQ_{n}$ and$BSQ_{n}$ , routing algorithms of$SSQ_{n}$ and$BSQ_{n}$ are given for all$n> 2$ respectively. We show that both$SSQ_{n}$ and$BSQ_{n}$ possess Hamiltonian cycle embedding for all$n> 2$ , and we also show that$SSQ_{n}$ is Hamiltonian-connected. It is noticeable that each vertex of$SSQ_{n}$ is contained in exactly one clique of size four, making it also a viable interconnection topology for data center networking since each clique of size four can be viewed as an efficient local data processing cluster of the network. Finally, as a by-product of proving vertex-transitivity of$BSQ_{n}$ , we mend a flaw in the Property 3 in [IEEE Trans. Comput. 46 (1997) 484–490].- 8 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 36 (6) , 1282-1293
Symmetric Properties and Two Variants of Shuffle-Cubes
Li et al. in [Inf. Process. Lett. 77 (2001) 35–41] proposed the shuffle-cube$SQ_{n}$ , a hypercube variant, as an attractive interconnection network topology for massive parallel and distributed systems. Diameter and symmetry are two desirable measures of network performance in terms of transmission delay and routing algorithms. Almost all$n$ -regular hypercube variants of dimension$n$ have diameter not less than$n/2$ . The diameter of the shuffle-cube is approximately a quarter of the diameter of the hypercube of the same dimension, making it a competitive candidate network topology. By far, symmetric properties of the shuffle-cube remain unknown. In this paper, we show that$SQ_{n}$ is not vertex-transitive for$n> 2$ , which is not an appealing property in interconnection networks. This shortcoming limits the practical application of the shuffle-cube. To overcome this limitation, two novel variants of the shuffle-cube, namely simplified shuffle-cube$SSQ_{n}$ and balanced shuffle-cube$BSQ_{n}$ are introduced, and their vertex-transitivity are proved simultaneously. By proposing the shuffle-cube-like graph, we obtain that both$SSQ_{n}$ and$BSQ_{n}$ are maximally connected, implying high connectivity similar to the hypercube. Additionally, super-connectivity, a refined parameter of connectivity, of$SSQ_{n}$ and$BSQ_{n}$ are also determined. Then, by vertex-transitivity of$SSQ_{n}$ and$BSQ_{n}$ , routing algorithms of$SSQ_{n}$ and$BSQ_{n}$ are given for all$n> 2$ respectively. We show that both$SSQ_{n}$ and$BSQ_{n}$ possess Hamiltonian cycle embedding for all$n> 2$ , and we also show that$SSQ_{n}$ is Hamiltonian-connected. It is noticeable that each vertex of$SSQ_{n}$ is contained in exactly one clique of size four, making it also a viable interconnection topology for data center networking since each clique of size four can be viewed as an efficient local data processing cluster of the network. Finally, as a by-product of proving vertex-transitivity of$BSQ_{n}$ , we mend a flaw in the Property 3 in [IEEE Trans. Comput. 46 (1997) 484–490].- 3 April 2025
- Published by Taylor & Francis in International Journal of Computer Mathematics: Computer Systems Theory
- Vol. 10 (1-2) , 81-94
The vertex-pancyclicity of the simplified shuffle-cube and the vertex-bipancyclicity of the balanced shuffle-cube
- 3 April 2025
- Published by Taylor & Francis in International Journal of Computer Mathematics: Computer Systems Theory
- Vol. 10 (1-2) , 81-94
The vertex-pancyclicity of the simplified shuffle-cube and the vertex-bipancyclicity of the balanced shuffle-cube
- 20 January 2025
- Published by World Scientific Pub Co Pte Ltd in Journal of Interconnection Networks
- Vol. 26 (01)
Enumeration of Maximum Matchings of Graphs
Counting maximum matchings in a graph is of great interest in statistical mechanics, solid-state chemistry, theoretical computer science, mathematics, among other disciplines. However, it is a challengeable problem to explicitly determine the number of maximum matchings of general graphs. In this paper, using Gallai–Edmonds structure theorem, we derive a computing formula for the number of maximum matchings in a graph. According to the formula, we obtain an algorithm to enumerate maximum matchings of a graph. In particular, the formula implies that computing the number of maximum matchings of a graph is converted to computing the number of perfect matchings of some induced subgraphs of the graph.
- 20 January 2025
- Published by World Scientific Pub Co Pte Ltd in Journal of Interconnection Networks
- Vol. 26 (01)
Enumeration of Maximum Matchings of Graphs
Counting maximum matchings in a graph is of great interest in statistical mechanics, solid-state chemistry, theoretical computer science, mathematics, among other disciplines. However, it is a challengeable problem to explicitly determine the number of maximum matchings of general graphs. In this paper, using Gallai–Edmonds structure theorem, we derive a computing formula for the number of maximum matchings in a graph. According to the formula, we obtain an algorithm to enumerate maximum matchings of a graph. In particular, the formula implies that computing the number of maximum matchings of a graph is converted to computing the number of perfect matchings of some induced subgraphs of the graph.
- Open Access
The vertex-pancyclicity of the simplified shuffle-cube and the vertex-bipancyclicity of the balanced shuffle-cube
A graph $G$ $=$ $(V,E)$ is vertex-pancyclic if for every vertex $u$ and any integer $l$ ranging from $3$ to $|V|$, $G$ contains a cycle $C$ of length $l$ such that $u$ is on $C$. A bipartite graph $G$ $=$ $(V,E)$ is vertex-bipancyclic if for every vertex $u$ and any even integer $l$ ranging from $4$ to $|V|$, $G$ contains a cycle $C$ of length $l$ such that $u$ is on $C$. The simplified shuffle-cube and the balanced shuffle-cube, which are two variants of the shuffle-cube and are superior to shuffle-cube in terms of vertex-transitivity. In this paper, we show that the $n$-dimensional simplified shuffle-cube is vertex-pancyclic for $n\geqslant 6$, and the $n$-dimensional balanced shuffle-cube is vertex-bipancyclic for $n\geqslant 2$.Open AccessThe vertex-pancyclicity of the simplified shuffle-cube and the vertex-bipancyclicity of the balanced shuffle-cube
A graph $G$ $=$ $(V,E)$ is vertex-pancyclic if for every vertex $u$ and any integer $l$ ranging from $3$ to $|V|$, $G$ contains a cycle $C$ of length $l$ such that $u$ is on $C$. A bipartite graph $G$ $=$ $(V,E)$ is vertex-bipancyclic if for every vertex $u$ and any even integer $l$ ranging from $4$ to $|V|$, $G$ contains a cycle $C$ of length $l$ such that $u$ is on $C$. The simplified shuffle-cube and the balanced shuffle-cube, which are two variants of the shuffle-cube and are superior to shuffle-cube in terms of vertex-transitivity. In this paper, we show that the $n$-dimensional simplified shuffle-cube is vertex-pancyclic for $n\geqslant 6$, and the $n$-dimensional balanced shuffle-cube is vertex-bipancyclic for $n\geqslant 2$. - 20 June 2024
- Published by Elsevier in Information Processing Letters
- Vol. 187
Hamiltonian cycles of balanced hypercube with disjoint faulty edges
- 20 June 2024
- Published by Elsevier in Information Processing Letters
- Vol. 187
Hamiltonian cycles of balanced hypercube with disjoint faulty edges