• Publications
  • Influence
Broadcasts in graphs
TLDR
We say that a function f : V → {0, 1, ..., diam(G)} is a broadcast if for every vertex v ∈ V, f(v) ≤ e(v). Expand
  • 68
  • 10
  • PDF
On weakly connected domination in graphs
TLDR
A dominating set D is a weakly connected dominating set of a connected graph G if (V,E@?(DxV)) is connected. Expand
  • 67
  • 6
Gallai-type theorems and domination parameters
TLDR
We investigate graphs which satisfy the upper bound for the minimum cardinality of the dominating set of a graph G with n vertices. Expand
  • 22
  • 4
  • PDF
Minus domination in graphs
TLDR
We introduce one of many classes of problems which can be defined in terms of 3-valued functions on the vertices of a graph G of the form |:V → {−1,0,1}. Expand
  • 49
  • 3
  • PDF
The Inverse Domination Number of a Graph
  • 39
  • 2
Nearly perfect sets in graphs
TLDR
We define n p ( G ) to be the minimum cardinality of a 1-minimal nearly perfect set, and N p (G) to be a maximum cardinality. Expand
  • 14
  • 2
Oxygen and hydrogen isotopes in fruit and vegetable juices.
(18)O/(16)O ratios from the juices of a number of fruits and vegetables were measured and found to be isotopically more enriched than the water in which they grew. Fast-growing high-water-contentExpand
  • 34
  • 1
  • PDF
The Algorithmic Complexity of Minus Domination in Graphs
TLDR
A three-valued function f defined on the vertices of a graph G = (V, E), f : V → {−1, 0, 1}, is a minus dominating function if the sum of its function values over any closed neighborhood is at least one. Expand
  • 42
  • 1
  • PDF
Minus domination in regular graphs
TLDR
A three-valued function f defined on the vertices of a graph G = ( V , E ), f : V → {−1, 0, 1}, is a minus dominating function if the sum of its function values over any closed neighborhood is at least one. Expand
  • 28
  • 1
  • PDF
The Path Partition Conjecture is true for claw-free graphs
The detour order of a graph G, denoted by @t(G), is the order of a longest path in G. The Path Partition Conjecture (PPC) is the following: If G is any graph and (a,b) any pair of positive integersExpand
  • 20
  • 1
  • PDF