Showing math.COShow all
3 papers · 1 filter
math.CO2021
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…
math.CO2019
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…
math.CO2018
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…