Say that an edge of a graph G dominates itself and every other edge sharing a vertex of it. An edge dominating set of a graph G= (V, E) is a subset of edges E′⊆ E which dominates all edges of G. In particular, if every ...

The pion electromagnetic form factor is calculated in the space- and time-like regions from -10 (GeV/c)2 up to 10 (GeV/c)2, within a front-form model. The dressed photon vertex where a photon decays in a quark-antiquark ...

The 'dominant conceptions' related to 'public sphere' and public space' present in Habermas, Arendt, Sennett and Davis are analyzed, exposing their ideas, and the reflections of their main critics. It is argued that the ...

This study was designed to assess the effects of feeding space availability on social behavior and performance of housed crossbreed sheep through the use of three different types of feeders. Thirty-six crossbreed ewes ...

The study uses dominant trees to describe the tinning, because they are those that possess larger energy inside of a forest settlement. The main objective of the work is to model and to select models to describe the ...

A biclique is a set of vertices that induce a complete bipartite graph. A graph G is biclique-Helly when its family of maximal bicliques satisfies the Helly property. If every induced subgraph of G is also biclique-Helly, ...

Biotic and abiotic factors interact with dominant plants—the locally most frequent or with the largest coverage—and nondominant plants differently, partially because dominant plants modify the environment where nondominant ...

We obtain a sparse domination principle for an arbitrary family of functions f(x,Q) , where x∈Rn and Q is a cube in Rn . When applied to operators, this result recovers our recent works [37, 39]. On the other hand, our ...