Minhui Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Minhui Li has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Chengfu Ye
School of Mathematics and Statistics, Qinghai Normal University, Xining, China
4 shared publications - Shumin Zhang
School of Mathematics and Statistics, Qinghai Normal University, Xining, China
4 shared publications Caiyun Wang
School of Mathematics and Statistics, Qinghai Normal University, Xining, Qinghai 810008, China
1 shared publication- Fengming Dong
National Institute of Education, Nanyang Technological University, Singapore, Singapore
1 shared publication Shumin Zhang
School of Mathematics and Statistics, Qinghai Normal University, Xining, Qinghai 810008, China
1 shared publication
Latest Publications
- Open Access
Partial domination of middle graphs
For any graph $G=(V,E)$, a subset $S\subseteq V$ is called {\it an isolating set} of $G$ if $V\setminus N_G[S]$ is an independent set of $G$, where $N_G[S]=S\cup N_G(S)$, and {\it the isolation number} of $G$, denoted by $ι(G)$, is the size of a smallest isolating set of $G$. In this article, we show that the isolation number of the middle graph of $G$ is equal to the size of a smallest maximal matching of $G$.Open AccessPartial domination of middle graphs
For any graph $G=(V,E)$, a subset $S\subseteq V$ is called {\it an isolating set} of $G$ if $V\setminus N_G[S]$ is an independent set of $G$, where $N_G[S]=S\cup N_G(S)$, and {\it the isolation number} of $G$, denoted by $ι(G)$, is the size of a smallest isolating set of $G$. In this article, we show that the isolation number of the middle graph of $G$ is equal to the size of a smallest maximal matching of $G$. - 1 January 2025
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 45 (4) , 1287
The probabilistic upper bounds on the isolation number of a graph
- 1 January 2025
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 45 (4) , 1287
The probabilistic upper bounds on the isolation number of a graph
- 14 October 2024
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 40 (6) , 1-10
Partial Domination of Hypergraphs
- 14 October 2024
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 40 (6) , 1-10
Partial Domination of Hypergraphs
- 10 November 2023
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 46 (4) , 1-11
Dominated coloring in product graphs
- 10 November 2023
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 46 (4) , 1-11
Dominated coloring in product graphs
- Open Access
- 7 October 2021
- Published by Hindawi Limited in Mathematical Problems in Engineering
- Vol. 2021, 1-7
The Dominator Edge Coloring of Graphs
Let G be a simple graph. A dominator edge coloring (DE-coloring) of G is a proper edge coloring in which each edge of G is adjacent to every edge of some color class (possibly its own class). The dominator edge chromatic number (DEC-number) of G is the minimum number of color classes among all dominator edge colorings of G , denoted by χ d ′ G . In this paper, we establish the bounds of the DEC-number of a graph, present the DEC-number of special graphs, and study the relationship of the DEC-number between G and the operations of G .
- 7 October 2021
- Published by Hindawi Limited in Mathematical Problems in Engineering
- Vol. 2021, 1-7
Open AccessThe Dominator Edge Coloring of Graphs
Let G be a simple graph. A dominator edge coloring (DE-coloring) of G is a proper edge coloring in which each edge of G is adjacent to every edge of some color class (possibly its own class). The dominator edge chromatic number (DEC-number) of G is the minimum number of color classes among all dominator edge colorings of G , denoted by χ d ′ G . In this paper, we establish the bounds of the DEC-number of a graph, present the DEC-number of special graphs, and study the relationship of the DEC-number between G and the operations of G .