Results 11 to 20 of about 39,709 (214)

Poetic Lithuania of Miłosz [PDF]

, 2016
The article deals with the images of Lithuania found in Czesław Miłosz’s poetry. The novels and essays have only been used to confirm the conclusions drawn from the interpretation of selected poems.
Berkan-Jabłońska, Maria
core   +2 more sources

Solutions to the cosmological constant problems [PDF]

, 2001
We critically review several recent approaches to solving the two cosmological constant problems. The "old" problem is the discrepancy between the observed value of $\Lambda$ and the large values suggested by particle physics models.
A. J. Riess, A. Linde, A. Vilenkin, A. Vilenkin, A. Vilenkin, A. Vilenkin, B. Schmidt, C. Armendáriz-Picon, C. Armendáriz-Picon, E. Guendelman, G. Dvali, G. Efstathiou, G. W. Gibbons, H. Martel, J. D. Barrow, J. D. Brown, J. Donoghue, J. Garriga, J. Garriga, J. Garriga, J. Garriga, J. Garriga, J. Garriga, J. Garriga, J. Garriga, J. Garriga, J. L. Feng, K. Lee, K. Lee, L. Abbot, L. F. Abbot, M. Tegmark, N. Arkani-Hamed, N. Deruelle, P. C. W. Davies, P. G. O. Freund, P. G. O. Freund, R. Basu, R. Bousso, R. Kallosh, S. Bludman, S. Coleman, S. Coleman, S. Giddings, S. Perlmutter, S. Perlmutter, S. Weinberg, S. Weinberg, S. Weinberg, S. Weinberg, T. Banks, T. Banks, V. Vanchurin, W. H. Press   +53 more
core   +3 more sources

Domination, Eternal Domination, and Clique Covering

Discussiones Mathematicae Graph Theory, 2015
Eternal and m-eternal domination are concerned with using mobile guards to protect a graph against infinite sequences of attacks at vertices. Eternal domination allows one guard to move per attack, whereas more than one guard may move per attack in the m-
Klostermeyer William F., Mynhardt C.M.
doaj   +1 more source

An Eternal Domination Problem in Grids

Theory and Applications of Graphs, 2017
A dynamic domination problem in graphs is considered in which an infinite sequence of attacks occur at vertices with mobile guards; the guard at the attacked vertex is required to vacate the vertex by moving to a neighboring vertex with no guard.
William Klostermeyer, Margaret-Ellen Messinger, Alejandro Angeli Ayello   +2 more
doaj   +1 more source

Eternal Domination: Criticality and Reachability

Discussiones Mathematicae Graph Theory, 2017
We show that for every minimum eternal dominating set, D, of a graph G and every vertex v ∈ D, there is a sequence of attacks at the vertices of G which can be defended in such a way that an eternal dominating set not containing v is reached.
Klostermeyer William F., MacGillivray Gary   +1 more
doaj   +1 more source

Guarding Networks Through Heterogeneous Mobile Guards [PDF]

, 2015
In this article, the issue of guarding multi-agent systems against a sequence of intruder attacks through mobile heterogeneous guards (guards with different ranges) is discussed.
Abbas, Waseem, Bhatia, Sajal, Koutsoukos, Xenofon   +2 more
core   +1 more source

The eternal fractal in the universe [PDF]

, 2001
Models of eternal inflation predict a stochastic self-similar geometry of the universe at very large scales and allow existence of points that never thermalize.
Winitzki, Serge
core   +4 more sources

Eternal m- Security Subdivision Numbers in Graphs

پژوهش‌های ریاضی, 2022
Let  be a simple graph with vertex set  and edges set . A set  is a dominating set if every vertex in  is adjacent to at least one vertex  in . An eternal 1-secure set of a graph G is defined as a dominating set  such that for any positive integer k and ...
Maryam Atapour
doaj  

Non-Abelian $S$-term dark energy and inflation [PDF]

, 2018
We study the role that a cosmic triad in the generalized $SU(2)$ Proca theory, specifically in one of the pieces of the Lagrangian that involves the symmetric version $S_{\mu \nu}$ of the gauge field strength tensor $F_{\mu \nu}$, has on dark energy and ...
Navarro, Andres A., Rodriguez, Yeinzon
core   +2 more sources

Disjoint Dominating Sets with a Perfect Matching

, 2017
In this paper, we consider dominating sets $D$ and $D'$ such that $D$ and $D'$ are disjoint and there exists a perfect matching between them. Let $DD_{\textrm{m}}(G)$ denote the cardinality of smallest such sets $D, D'$ in $G$ (provided they exist ...
Ayello, Alejandro Angeli, Klostermeyer, William F., Messinger, Margaret-Ellen   +2 more
core   +1 more source