Name
Abstract | ||
|---|---|---|
DP-coloring as a generalization of list coloring was introduced recently by Dvorak and Postle. The DP-chromatic number of G, denoted by chi(DP)(G), is the minimum number k such that G is DP - k-colorable. The variation of the Randic index R'(G) of a graph G is defined as the sum of the weights 1/max{d(u),d(v)} of all edges u(v) of G, where d(u) is the degree of the vertex u in G. In this paper, we show that for any graph G of order n, X-DP(G) <= 2R'(G), and this bound is sharp for all n and 2 <= chi(DP)(G) <= n. (C) 2022 Elsevier B.V. All rights reserved. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1016/j.dam.2022.03.032 | DISCRETE APPLIED MATHEMATICS |
Keywords | DocType | Volume |
DP-coloring, DP-chromatic number, Randic index | Journal | 316 |
ISSN | Citations | PageRank |
0166-218X | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jian-Bo Lv | 1 | 0 | 0.34 |
| Jianxi Li | 2 | 0 | 0.34 |
| Ziwen Huang | 3 | 0 | 1.69 |