Min Liu

Dr. Min Liu

orcid

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2013 in Acta Mathematica Scientia
Verified
Journal Article
Closed access
MLMin Liu
Min Liu
HLHongmei Liu
Hongmei Liu

1 November 2013 in Acta Mathematica Scientia
Verified
Journal Article
Closed access
YZYanjuan zhang
Yanjuan zhang
HLHongmei Liu
Hongmei Liu
MLMin Liu
Min Liu

28 December 2023 in Symmetry
Verified
Journal Article
Open access
PDF file
MLMin Liu
Min Liu
The enhanced hypercube is a well-known variant of the hypercube and can be constructed from a hypercube by adding an edge to every pair of vertices with complementary addresses. Let Fv denote the set of faulty vertices in an n-dimensional enhanced hypercube Qn,k(1≤k≤n−1). In this paper, we conclude that if n≥2, then every fault-free edge of Qn,k−Fv lies on a fault-free cycle of every even length from 4 to 2n−2|Fv|, and if n(≥2) and k have the different parity, then every fault-free edge of Qn,k−Fv lies on a fault-free cycle of every possible odd length from n−k+4 to 2n−2|Fv|−1, where |Fv|≤n−2.

5 April 2016 in Acta Mathematicae Applicatae Sinica, English Series
Verified
Journal Article
Closed access
PDF file
MLMin Liu
Min Liu
HLHongmei Liu
Hongmei Liu

6 June 2024 in IEEE Access
Verified
Journal Article
Open access
MLMin Liu
Min Liu
In a network G , if each vertex of G is incident to at least g (≥1) fault-free vertices, then we say the network is g -conditionally faulty. An enhanced hypercube Qn,k is a network, which is an attractive variant of the hypercube Qn by adding complementary edges between any vertices with the complementary addresses. Let Fv * be the set of faulty vertices in Qn,k . In this paper, in the 4-conditionally faulty Qn,k , we show that Qn,k - Fv * contains a fault-free even cycle ranging in length from 4 to 2 n -2| Fv *|, where n ≥3 and | Fv *|≤2 n -4; and also contains a fault-free odd cycle ranging in length from n - k +2 to 2 n -2| Fv *|-1, where n (≥3), 2|( n - k ) and | Fv *|≤2 n -5.

10 July 2019 in Wuhan University Journal of Natural Sciences
Verified
Journal Article
Closed access
PDF file
MLMin Liu
Min Liu
ZHZhiquan Hu
Zhiquan Hu
For a fixed graph F, a graph G is F-saturated if it has no F as a subgraph, but does contain F after the addition of any new edge. The saturation number, sat(n, F), is the minimum number of edges of a graph in the set of all F-saturated graphs with order n. In this paper, we determine the saturation number sat(n,2P3 ∪ tP2) and characterize the extremal graphs for n ⩾ 6t + 8.