WZWenwei Zhao
Wenwei Zhao
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Wenwei Zhao has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Ning Wang
University of South Florida
1 shared publication - Qinglin Jia
School of Mathematics and Physics, Hebei GEO University, Shijiazhuang 050031, China
1 shared publication - Rui Duan
University of South Florida
1 shared publication - Yao Liu
University of South Florida
1 shared publication - Yongqiang Zhao
School of Mathematics and Physics, Hebei GEO University, Shijiazhuang 050031, China
1 shared publication - Zhengping Jay Luo
Department of Computer Science and Physics Rider University Lawrenceville United States
1 shared publication
Latest Publications
- Open Access
- 29 May 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (11) , 1822
On the Coalition Number of the dth Power of the n-Cycle
A coalition in a graph G consists of two disjoint sets of vertices and , neither of which is a dominating set but whose union is a dominating set. A coalition partition in a graph G is a vertex partition such that every set is not a dominating set but forms a coalition with another set which is not a dominating set. The coalition number equals the maximum k of a coalition partition of G. In this paper, we study the coalition number of the dth power of the n-cycle , where and . We show that for or , and also provide some bounds of for the other cases. As a special case, we obtain the exact value of the coalition number of .- 29 May 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (11) , 1822
Open AccessOn the Coalition Number of the dth Power of the n-Cycle
A coalition in a graph G consists of two disjoint sets of vertices and , neither of which is a dominating set but whose union is a dominating set. A coalition partition in a graph G is a vertex partition such that every set is not a dominating set but forms a coalition with another set which is not a dominating set. The coalition number equals the maximum k of a coalition partition of G. In this paper, we study the coalition number of the dth power of the n-cycle , where and . We show that for or , and also provide some bounds of for the other cases. As a special case, we obtain the exact value of the coalition number of . - 24 February 2024
- Published by Springer Nature
- p. 99-119
Understanding the Ineffectiveness of the Transfer Attack in Intrusion Detection System
- 24 February 2024
- Published by Springer Nature
- p. 99-119
Understanding the Ineffectiveness of the Transfer Attack in Intrusion Detection System