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 neighbor in a set D. The differential of a set D is defined as ∂(D)=|B(D)|−|D| and the differential of a graph to equal the maximum value of ∂(D) for any subset D of V. In this paper, we obtain several tight lower bounds for the differential of a graph
A vertex v of a graph G is a boundary vertex if there exists a vertex u such that the distance in G ...
AbstractA vertex v of a graph G is a boundary vertex if there exists a vertex u such that the distan...
AbstractA three-valued function f defined on the vertex set of a graph G=(V,E), f:V→{−1,0,1} is a mi...
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...
Let G = ( V , E ) be a simple graph with vertex set V and edge set E. Let D be a subset of V...
Let G=(V,E) be a graph, and let β∈R. Motivated by a service coverage maximization problem with limit...
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...
Given an n-vertex graph G and two positive integers d, k ∈ N, the (d, kn)-differential col-oring pro...
Given an n-vertex graph Gand two positive integers d, k is an element of N, the (d, kn)-differential...
Let G=(V,E) be an arbitrary graph, and consider the following game. You are allowed to buy as many t...
Upper and lower bounds are obtained for the domination number of a graph, by means of a lemma involv...
We study the maximum differential graph coloring problem, in which the goal is to find a vertex labe...
A vertex v of a graph G is a boundary vertex if there exists a vertex u such that the distance in G ...
AbstractA vertex v of a graph G is a boundary vertex if there exists a vertex u such that the distan...
AbstractA three-valued function f defined on the vertex set of a graph G=(V,E), f:V→{−1,0,1} is a mi...
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...
Let G = ( V , E ) be a simple graph with vertex set V and edge set E. Let D be a subset of V...
Let G=(V,E) be a graph, and let β∈R. Motivated by a service coverage maximization problem with limit...
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...
Given an n-vertex graph G and two positive integers d, k ∈ N, the (d, kn)-differential col-oring pro...
Given an n-vertex graph Gand two positive integers d, k is an element of N, the (d, kn)-differential...
Let G=(V,E) be an arbitrary graph, and consider the following game. You are allowed to buy as many t...
Upper and lower bounds are obtained for the domination number of a graph, by means of a lemma involv...
We study the maximum differential graph coloring problem, in which the goal is to find a vertex labe...
A vertex v of a graph G is a boundary vertex if there exists a vertex u such that the distance in G ...
AbstractA vertex v of a graph G is a boundary vertex if there exists a vertex u such that the distan...
AbstractA three-valued function f defined on the vertex set of a graph G=(V,E), f:V→{−1,0,1} is a mi...
DOI
Add to ORKG