• Publications
• Influence
Fundamentals of domination in graphs
• Mathematics, Computer Science
• Pure and applied mathematics
• 1998
Bounds on the domination number domination, independence and irredundance efficiency, redundancy and the duals changing and unchanging domination conditions on the dominating set varieties of domination multiproperty and multiset parameters sums and products of parameters dominating functions frameworks for domination domination complexity and algorithms. Expand
• 3,158
• 229
• PDF
Domination in Graphs Applied to Electric Power Networks
• Computer Science, Mathematics
• SIAM J. Discret. Math.
• 1 April 2002
The problem of monitoring an electric power system by placing as few measurement devices in the system as possible is closely related to vertex covering and dominating set problems in graphs. Expand
• 266
• 41
Domination in graphs : advanced topics
• Mathematics
• 1998
LP-duality, complementarity and generality of graphical subset parameters dominating functions in graphs fractional domination and related parameters majority domination and its generalizationsExpand
• 1,290
• 36
Paired‐domination in graphs
• Mathematics
• 1 October 1998
In a graph G = (V, E) if we think of each vertex s as the possible location for a guard capable of protecting each vertex in its closed neighborhood N[s], then “domination” requires every vertex toExpand
• 150
• 22
Double Domination in Graphs
• Mathematics, Computer Science
• Ars Comb.
• 2000
• 155
• 12
Global Defensive Alliances in Graphs
• Mathematics, Computer Science
• Electron. J. Comb.
• 8 December 2003
A defensive alliance in a graph G =( V,E) is a set of vertices S V satisfying the condition that for every vertex v 2 S, the number of neighbors v has in S plus one (counting v) is at least as large as the number the neighbors it has in V S. Expand
• 110
• 12
• PDF
Broadcasts in graphs
• Computer Science, Mathematics
• Discret. Appl. Math.
• 2006
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
• 69
• 10
• PDF
Double Roman domination
• Computer Science, Mathematics
• Discret. Appl. Math.
• 1 October 2016
A double Roman dominating function is a function f with the property that if f ( v ) = 0 , then vertex v must have at least two neighbors assigned 2 under f or one neighbor with f ( w ) = 3 under f . Expand
• 76
• 8
Roman {2}-domination
• Computer Science, Mathematics
• Discret. Appl. Math.
• 11 May 2016
In this paper, we initiate the study of a variant of Roman dominating functions. Expand
• 81
• 8
The diameter of total domination vertex critical graphs
• Computer Science, Mathematics
• Discret. Math.
• 28 September 2004
We characterize the connected graphs with minimum degree one that are γ t -critical and we obtain sharp bounds on their maximum diameter. Expand
• 52
• 7
• PDF