Instead of studying evolutions governed by an evolutionary system starting at a given initial state on a prescribed future time interval, finite or infinite, we tackle the problem of looking both for a past interval [T − D, T ] of aperture (or length, duration) D and for the viable evolutions arriving at a prescribed terminal state at the end of the temporal window (and thus telescoping if more...

an equitable domination has interesting application in the contextof social networks. in a network, nodes with nearly equal capacitymay interact with each other in a better way. in the societypersons with nearly equal status, tend to be friendly. in thispaper, we introduce new variant of equitable domination of agraph. basic properties and some interesting results have beenobtained.

Generalizing work on graphs, Chang and Roussel introduced k-power domination in hypergraphs conjectured the upper bound for number r-uniform n vertices was nr+k. This shown to be true simple graphs (r=2) it further that only a family of hypergraphs, known as squid attained this bound. In paper, conjecture is proven hold with r=3 or 4; but false, by counterexample, r≥7. Furthermore, we show are ...

Inclusion/exclusion and measure and conquer are two of the most important recent new developments in the field of exact exponential time algorithms. Algorithms that combine both techniques have been found very recently, but thus far always use exponential space. In this paper, we try to obtain fast exponential time algorithms for graph domination problems using only polynomial space. Using a no...

s 1 van Aardt S. Maximal nontraceable oriented graphs . . . . . . . . . . 1 Bača M. Total labelings of graphs . . . . . . . . . . . . . . . . . . . . 1 Bacsó G. Elementary bipartite graphs and unique colorability . . . . . 1 Borowiecki M. On F -decompositions of graphs . . . . . . . . . . . . . 2 Bujtás Cs. Color-bounded hypergraphs, II: Interval hypergraphs and hypertrees . . . . . . . . . . ....