4 papers
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…
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…