1 citations · 1 across the 14 of their papers we have counts for
16 papers
Sharp planar Turán bounds for quasi-double stars
Zehui Shao, Enqiang Zhu, Shaohui Wang
We study -free planar graphs for , where the quasi-double star is obtained from a three-vertex path by attaching leaves to one end…
Total-coloring of planar graphs with maximum degree 6 and without prescribed 4-cycles
Enqiang Zhu, Yangyang Zhou, Jin Xu
The Total Coloring Conjecture (TCC) is a challenging unsolved problem posed by Behzad and Vizing independently, which states that every simple graph admits a ( +2)-total-…
The Total Coloring Conjecture holds for planar graphs without three special subgraphs
Rongjin Su, Gang Fang, Enqiang Zhu
The Total Coloring Conjecture (TCC) for planar graphs with a maximum degree of six remains open. Previous studies suggest that TCC is valid for such graphs if they do not contain a…
Boosting drug-disease association prediction for drug repositioning via dual-feature extraction and cross-dual-domain decoding
Enqiang Zhu, Xiang Li, Chanjuan Liu +1
The extraction of biomedical data has significant academic and practical value in contemporary biomedical sciences. In recent years, drug repositioning, a cost-effective strategy f…
Improving Critical Node Detection Using Neural Network-based Initialization in a Genetic Algorithm
Chanjuan Liu, Shike Ge, Zhihan Chen +4
The Critical Node Problem (CNP) is concerned with identifying the critical nodes in a complex network. These nodes play a significant role in maintaining the connectivity of the ne…
A Dual-mode Local Search Algorithm for Solving the Minimum Dominating Set Problem
Enqiang Zhu, Yu Zhang, Shengzhi Wang +2
Given a graph, the minimum dominating set (MinDS) problem is to identify a smallest set of vertices such that every vertex not in is adjacent to at least one vertex in .…
A universal DNA computing model for solving NP-hard subset problems
Enqiang Zhu, Xianhang Luo, Chanjuan Liu +2
DNA computing, a nontraditional computing mechanism, provides a feasible and effective method for solving NP-hard problems because of the vast parallelism and high-density storage…
Mining Large Independent Sets on Massive Graphs
Yu Zhang, Witold Pedrycz, Chanjuan Liu +1
The Maximum Independent Set problem is fundamental for extracting conflict-free structure from large graphs, with applications in scheduling, recommendation, and network analysis.…
PHEE: A phased hybrid evaluation-enhanced approach for identifying influential users in social networks
Enqiang Zhu, Haosen Wang, Yu Zhang +2
For the purpose of maximizing the spread of influence caused by a certain small number k of nodes in a social network, we are asked to find a k-subset of nodes (i.e., a seed set) w…
Metric dimension and edge metric dimension of unicyclic graphs
Enqiang Zhu, Shaoxiang Peng, Chanjuan Liu
The metric (resp. edge metric) dimension of a simple connected graph , denoted by dim (resp. edim), is the cardinality of a smallest vertex subset fo…
Notes on k-rainbow independent domination in graphs
Enqiang Zhu, Chanjuan Liu
The -rainbow independent domination number of a graph , denoted , is the cardinality of a smallest set consisting of two vertex-disjoint independent sets $V_1…
On a Sufficient Condition for Planar Graphs of Maximum Degree 6 to be Totally 7-Colorable
Enqiang Zhu, Chanjuan Liu, Yongsheng Rao
A total -coloring of a graph is an assignment of colors to its vertices and edges such that no two adjacent or incident elements receive the same color. The Total Coloring C…
On Spectral Graph Embedding: A Non-Backtracking Perspective and Graph Approximation
Fei Jiang, Lifang He, Yi Zheng +3
Graph embedding has been proven to be efficient and effective in facilitating graph analysis. In this paper, we present a novel spectral framework called NOn-Backtracking Embedding…
On uniquely 3-colorable plane graphs without prescribed adjacent faces
Zepeng Li, Naoki Matsumoto, Enqiang Zhu +2
A graph is \emph{uniquely k-colorable} if the chromatic number of is and has only one -coloring up to permutation of the colors. For a plane graph , two faces…
Tree-colorable maximal planar graphs
Enqiang Zhu, Zepeng Li, Zehui Shao +1
A tree-coloring of a maximal planar graph is a proper vertex -coloring such that every bichromatic subgraph, induced by this coloring, is a tree. A maximal planar graph is t…
Size of edge-critical uniquely 3-colorable planar graphs
Zepeng Li, Enqiang Zhu, Zehui Shao +1
A graph is \emph{uniquely k-colorable} if the chromatic number of is and has only one -coloring up to permutation of the colors. A uniquely -colorable graph $…