Jun Yue
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
Research Subjects
Jun Yue has a total of 46 co-authors. Here are the top co-authors by number of shared publications:
- Xueliang Li
Center for Combinatorics and LPMC, Nankai University, Tianjin, China
5 shared publications - Yongtang Shi
Nankai University
5 shared publications - Meiqin Wei
College of Arts and Sciences Shanghai Maritime University 201306 Shanghai China
4 shared publications - Yan Zhao
Department of Mathematics Taizhou University 225300 Taizhou China
3 shared publications - Changqing Xi
Center for Combinatorics and LPMC Nankai University 300071 Tianjin China
2 shared publications - Hengzhe Li
College of Mathematics and Information Science, Henan Normal University, Xinxiang, People’s Republic of China
2 shared publications
Latest Publications
- 30 September 2026
- Published by World Scientific Pub Co Pte Ltd in Journal of Interconnection Networks
A Short Survey on the Disjunctive (Total) Domination Numbers of Graphs
This survey reviews recent results on the disjunctive domination numbers and the disjunctive total domination numbers in graphs. Tight bounds and exact values are presented for trees, grids, and Harary graphs. The ratio [Formula: see text] is analyzed for various graph families, where [Formula: see text] and [Formula: see text] are the domination number and the disjunctive domination number of a graph [Formula: see text]. Algorithmic results, including NP-completeness and polynomial-time solutions for trees and interval graphs, are discussed. The survey concludes with open problems, such as the cubic graph conjecture and the claw-free graph conjecture.
- 30 September 2026
- Published by World Scientific Pub Co Pte Ltd in Journal of Interconnection Networks
A Short Survey on the Disjunctive (Total) Domination Numbers of Graphs
This survey reviews recent results on the disjunctive domination numbers and the disjunctive total domination numbers in graphs. Tight bounds and exact values are presented for trees, grids, and Harary graphs. The ratio [Formula: see text] is analyzed for various graph families, where [Formula: see text] and [Formula: see text] are the domination number and the disjunctive domination number of a graph [Formula: see text]. Algorithmic results, including NP-completeness and polynomial-time solutions for trees and interval graphs, are discussed. The survey concludes with open problems, such as the cubic graph conjecture and the claw-free graph conjecture.
- 20 March 2026
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 524
On independent domination and packing numbers of subcubic graphs
- 20 March 2026
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 524
On independent domination and packing numbers of subcubic graphs
- 5 March 2025
- Published by Springer Nature
- p. 314-325
Bipartite Domination in Outerplanar Graphs
- Open Access
- 22 August 2024
- Published by Scilight Press Pty Ltd in Applied Mathematics and Statistics
- Vol. 1 (1) , 3
Independent Domination in Claw-Free Cubic Graphs
Article Linyu Li 1 and Jun Yue 2,* 1 School of Mathematics and Statistics, Shandong Normal University, Jinan 250358, China 2 School of Mathematics Science, Tiangong University, Tianjin 300387, China * Correspondence: yuejun06@126.com Received: 7 June 2024; Revised: 5 August 2024; Accepted: 13 August 2024; Published: 22 August 2024 Abstract: A vertex set S of a graph G is called an independent dominating set if S is an independent set and each vertex in V(G)\S is adjacent to a vertex in S. The independent domination number i(G) of G is the minimum cardinality of an independent dominating set in G. This paper first proves that if G is a connected \(K_{1,3}\) -free cubic graph, then \(i(G)\leq \frac{1}{3}|V(G)|\) . Meanwhile, \(i(G)=\frac{1}{3}|V(G)|\) if and only if \(G\in \mathcal{H}\) , where \(\mathcal{H}\) is an infinite cubic family with each graph being a \(C_6^+\) -necklace. Then, it is shown that if G is a \(\{K_{1,3}, K_4^-, C_6^+\}\) -free cubic graph with no \(C_3\Box K_2\) -component, then \(i(G)\leq \frac{5}{18}|V(G)|\) . This result is tight.- 22 August 2024
- Published by Scilight Press Pty Ltd in Applied Mathematics and Statistics
- Vol. 1 (1) , 3
Open AccessIndependent Domination in Claw-Free Cubic Graphs
Article Linyu Li 1 and Jun Yue 2,* 1 School of Mathematics and Statistics, Shandong Normal University, Jinan 250358, China 2 School of Mathematics Science, Tiangong University, Tianjin 300387, China * Correspondence: yuejun06@126.com Received: 7 June 2024; Revised: 5 August 2024; Accepted: 13 August 2024; Published: 22 August 2024 Abstract: A vertex set S of a graph G is called an independent dominating set if S is an independent set and each vertex in V(G)\S is adjacent to a vertex in S. The independent domination number i(G) of G is the minimum cardinality of an independent dominating set in G. This paper first proves that if G is a connected \(K_{1,3}\) -free cubic graph, then \(i(G)\leq \frac{1}{3}|V(G)|\) . Meanwhile, \(i(G)=\frac{1}{3}|V(G)|\) if and only if \(G\in \mathcal{H}\) , where \(\mathcal{H}\) is an infinite cubic family with each graph being a \(C_6^+\) -necklace. Then, it is shown that if G is a \(\{K_{1,3}, K_4^-, C_6^+\}\) -free cubic graph with no \(C_3\Box K_2\) -component, then \(i(G)\leq \frac{5}{18}|V(G)|\) . This result is tight. - Open Access
On independent domination and packing numbers of subcubic graphs
In a recent paper, Cho and Kim proved that in subcubic graphs, the independent domination number is at most three times the packing number. They subsequently posed the question of characterizing subcubic graphs that achieve this bound. In this paper, we completely solve the question by proving that exactly four graphs meet this bound.
Open AccessOn independent domination and packing numbers of subcubic graphs
In a recent paper, Cho and Kim proved that in subcubic graphs, the independent domination number is at most three times the packing number. They subsequently posed the question of characterizing subcubic graphs that achieve this bound. In this paper, we completely solve the question by proving that exactly four graphs meet this bound.
- 22 November 2022
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 46 (1) , 1-13
The Restrained Double Roman Domination in Graphs
- 22 November 2022
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 46 (1) , 1-13
The Restrained Double Roman Domination in Graphs
- 3 January 2022
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 44 (1) , 331-342
The effect of vertex and edge deletion on the edge metric dimension of graphs
- 3 January 2022
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 44 (1) , 331-342
The effect of vertex and edge deletion on the edge metric dimension of graphs
- 24 July 2021
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 37 (6) , 2521-2533
On Tree-Connectivity and Path-Connectivity of Graphs
- 24 July 2021
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 37 (6) , 2521-2533
On Tree-Connectivity and Path-Connectivity of Graphs
- Open Access
- 1 January 2020
- Published by American Institute of Mathematical Sciences (AIMS) in AIMS Mathematics
- Vol. 5 (5) , 4459-4465
On the edge metric dimension of graphs
Let $G = (V, E)$ be a connected graph of order $n$. $S \subseteq V$ is an edge metric generator of $G$ if any pair of edges in $E$ can be distinguished by some element of $S$. The edge metric dimension $edim(G)$ of a graph $G$ is the least size of an edge metric generator of $G$. In this paper, we give the characterization of all connected bipartite graphs with $edim = n-2$, which partially answers an open problem of Zubrilina (2018). Furthermore, we also give a sufficient and necessary condition for $edim(G) = n-2$, where $G$ is a graph with maximum degree $n-1$. In addition, the relationship between the edge metric dimension and the clique number of a graph $G$ is investigated by construction.- 1 January 2020
- Published by American Institute of Mathematical Sciences (AIMS) in AIMS Mathematics
- Vol. 5 (5) , 4459-4465
Open AccessOn the edge metric dimension of graphs
Let $G = (V, E)$ be a connected graph of order $n$. $S \subseteq V$ is an edge metric generator of $G$ if any pair of edges in $E$ can be distinguished by some element of $S$. The edge metric dimension $edim(G)$ of a graph $G$ is the least size of an edge metric generator of $G$. In this paper, we give the characterization of all connected bipartite graphs with $edim = n-2$, which partially answers an open problem of Zubrilina (2018). Furthermore, we also give a sufficient and necessary condition for $edim(G) = n-2$, where $G$ is a graph with maximum degree $n-1$. In addition, the relationship between the edge metric dimension and the clique number of a graph $G$ is investigated by construction. - Open Access
- 1 January 2020
- Published by American Institute of Mathematical Sciences (AIMS) in AIMS Mathematics
- Vol. 5 (4) , 3010-3018
Polychromatic colorings of hypergraphs with high balance
Let $m$ be a positive integer and $C = \{1, 2, \dots, m\}$ be a set of $m$ colors. A polychromatic $m$-coloring of a hypergraph is a coloring of its vertices in such a way that every hyperedge contains at least one vertex of each color in $C$. This problem is a generalization of $2$-colorings of hypergraphs and has close relations with the longest lifetime problem for a wireless sensor network, cover decompositions problem of hypergraphs and vertex cover problem of hypergraphs. In this paper, a main work is to find the maximum $m$ that a hypergraph $H$, with $n$ hyperedges, admits a polychromatic $m$-coloring such that each color appears at least $k$ times on each hyperedge. A $2\ln n$ approximation to the number is obtained when $k$ is a fixed positive integer. For the case that $k = O(n\ln n)$, there exists an $O(\ln n)$ approximation algorithm; for the case that $k = \omega (n\ln n)$, there exists a $(2+\sqrt{3})k$ approximation algorithm.- 1 January 2020
- Published by American Institute of Mathematical Sciences (AIMS) in AIMS Mathematics
- Vol. 5 (4) , 3010-3018
Open AccessPolychromatic colorings of hypergraphs with high balance
Let $m$ be a positive integer and $C = \{1, 2, \dots, m\}$ be a set of $m$ colors. A polychromatic $m$-coloring of a hypergraph is a coloring of its vertices in such a way that every hyperedge contains at least one vertex of each color in $C$. This problem is a generalization of $2$-colorings of hypergraphs and has close relations with the longest lifetime problem for a wireless sensor network, cover decompositions problem of hypergraphs and vertex cover problem of hypergraphs. In this paper, a main work is to find the maximum $m$ that a hypergraph $H$, with $n$ hyperedges, admits a polychromatic $m$-coloring such that each color appears at least $k$ times on each hyperedge. A $2\ln n$ approximation to the number is obtained when $k$ is a fixed positive integer. For the case that $k = O(n\ln n)$, there exists an $O(\ln n)$ approximation algorithm; for the case that $k = \omega (n\ln n)$, there exists a $(2+\sqrt{3})k$ approximation algorithm.