Let G=(V,E) be a graph, and let β∈R. Motivated by a service coverage maximization problem with limited resources, we study the β-differential of G. The β-differential of G, denoted by ∂β(G), is defined as ∂β(G):=max{|B(S)|−β|S|suchthatS⊆V}. The case in which β=1 is known as the differential of G, and hence ∂β(G) can be considered as a generalization of the differential ∂(G) of G. In this paper, upper and lower bounds for ∂β(G) are given in terms of its order |G|, minimum degree δ(G), maximum degree Δ(G), among other invariants of G. Likewise, the β-differential for graphs with heavy vertices is studied, extending the set of applications that this concept can have
AbstractLet G be a simple graph of order n(G). A vertex set D of G is dominating if every vertex not...
AbstractWe examine classes of extremal graphs for the inequality γ(G)⩽|V|-max{d(v)+βv(G)}, where γ(G...
We study the maximum differential graph coloring problem, in which the goal is to find a vertex labe...
Let G = ( V , E ) be a simple graph with vertex set V and edge set E. Let D be a subset of V...
AbstractLet G=(V,E) be a graph of order n and let B(D) be the set of vertices in V∖D that have a nei...
Abstract. Let X ⊂ V be a set of vertices in a graph G = (V, E). The boundary B(X) of X is defined to...
Let G = (V, E) be an arbitrary graph, and consider the following game. You are allowed to buy as man...
Let G = (V, E) be a graph of order n and let B(D) be the set of vertices in V \ D that have a neighb...
Let G = (V, E) be a graph of order n and let B(D) be the set of vertices in V\D that have a neighbor...
Let G=(V,E) be an arbitrary graph, and consider the following game. You are allowed to buy as many t...
AbstractIn 1958, Claude Berge studied the domination number γ(G) of a graph and showed that every gr...
Given an n-vertex graph G and two positive integers d, k ∈ N, the (d, kn)-differential col-oring pro...
Let $delta (G)$, $Delta (G)$ and $gamma(G)$ be the minimum degree, maximum degree and domin...
AbstractWe are interested in a notion of domination related to both vertices and edges of graphs. We...
Given an n-vertex graph Gand two positive integers d, k is an element of N, the (d, kn)-differential...
AbstractLet G be a simple graph of order n(G). A vertex set D of G is dominating if every vertex not...
AbstractWe examine classes of extremal graphs for the inequality γ(G)⩽|V|-max{d(v)+βv(G)}, where γ(G...
We study the maximum differential graph coloring problem, in which the goal is to find a vertex labe...
Let G = ( V , E ) be a simple graph with vertex set V and edge set E. Let D be a subset of V...
AbstractLet G=(V,E) be a graph of order n and let B(D) be the set of vertices in V∖D that have a nei...
Abstract. Let X ⊂ V be a set of vertices in a graph G = (V, E). The boundary B(X) of X is defined to...
Let G = (V, E) be an arbitrary graph, and consider the following game. You are allowed to buy as man...
Let G = (V, E) be a graph of order n and let B(D) be the set of vertices in V \ D that have a neighb...
Let G = (V, E) be a graph of order n and let B(D) be the set of vertices in V\D that have a neighbor...
Let G=(V,E) be an arbitrary graph, and consider the following game. You are allowed to buy as many t...
AbstractIn 1958, Claude Berge studied the domination number γ(G) of a graph and showed that every gr...
Given an n-vertex graph G and two positive integers d, k ∈ N, the (d, kn)-differential col-oring pro...
Let $delta (G)$, $Delta (G)$ and $gamma(G)$ be the minimum degree, maximum degree and domin...
AbstractWe are interested in a notion of domination related to both vertices and edges of graphs. We...
Given an n-vertex graph Gand two positive integers d, k is an element of N, the (d, kn)-differential...
AbstractLet G be a simple graph of order n(G). A vertex set D of G is dominating if every vertex not...
AbstractWe examine classes of extremal graphs for the inequality γ(G)⩽|V|-max{d(v)+βv(G)}, where γ(G...
We study the maximum differential graph coloring problem, in which the goal is to find a vertex labe...