• Publications
  • Influence
Fundamentals of domination in graphs
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,129
  • 227
  • PDF
Domination in Graphs Applied to Electric Power Networks
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
  • 263
  • 41
Domination in graphs : advanced topics
LP-duality, complementarity and generality of graphical subset parameters dominating functions in graphs fractional domination and related parameters majority domination and its generalizationsExpand
  • 1,280
  • 36
Towards a theory of domination in graphs
This paper presents a quick review of results and applications concerning dominating sets in graphs. Expand
  • 496
  • 35
A survey of gossiping and broadcasting in communication networks
Gossiping and broadcasting are two problems of information dissemination described for a group of individuals connected by a communication network. Expand
  • 1,292
  • 27
Total domination in graphs
A set D of vertices of a finite, undirected graph G = (V, E) is a total dominating set if every vertex of V is adjacent to some vertex of D. Expand
  • 383
  • 23
Information Dissemination in Trees
In large organizations there is frequently a need to pass information from one place, e.g., the president’s office or company headquarters, to all other divisions, departments or employees. Expand
  • 190
  • 22
Roman domination in graphs
Abstract A Roman dominating function on a graph G=(V,E) is a function f : V→{0,1,2}. Expand
  • 314
  • 21
  • PDF
Braodcast Chromatic Numbers of Graphs
A function π : V → {1, . . . , k} is a broadcast coloring. Expand
  • 88
  • 21
  • PDF
Global Defensive Alliances in Graphs
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