The restrained k-rainbow reinforcement number of graphs

期刊： DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2021; 13 (03)

Let k be a positive integer and G be a simple graph. A restrained k-rainbow dominating function (RkRDF) of G is a function f from the vertex set V (G)......

On the maximum connective eccentricity index among k-connected graphs

期刊： DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2021; 13 (2)

The connective eccentricity index (CEI for short) of a graph G is defined as xi(ce)(G) = Sigma(v is an element of V (G))d(G)(v)/epsilon(G)(v), where d......

2-Distance coloring of planar graph

期刊： DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2021; 13 (2)

The k-2-distance coloring of graph G is a mapping phi : V (G) ->{1, 2, ... ,k} if any two vertices at distance at most two from each other get diff......

k-Submodular maximization with two kinds of constraints

期刊： DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2021; 13 (04)

k-submodular maximization is a generalization of submodular maximization, which requires us to select k disjoint subsets instead of one subset. Attrac......

Constant-approximation for minimum weight partial sensor cover

期刊： DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2021; 13 (04)

Consider a set of homogeneous wireless sensors, S with nonnegative weight w(s) for each sensor s is an element of S. Let P be a set of target points. ......

Arithmetic-geometric energy of specific graphs

期刊： DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2021; 13 (2)

Let G be a simple graph of order n with vertex set V (G) = {v(1), v(2), ... , v(n)} and edge set E(G). The arithmetic-geometric matrix A(AG)(G) = (h(i......

DP-coloring on planar graphs without given adjacent short cycles

期刊： DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2021; 13 (2)

DP-coloring (also known as correspondence coloring) introduced by Dvorak and Postle (2015) is a generalization of list coloring. In 2019, Chen et al. ......