Results 1 to 10 of about 3,903,221 (297)
The limiting equation for Neumann Laplacians on shrinking domains
Electronic Journal of Differential Equations, 2000 Let ${Omega_{epsilon} }_{0 < epsilon le1}$ be an indexed family of connected open sets in ${mathbb R}^2$, that shrinks to a tree $Gamma$ as $epsilon$ approaches zero. Let $H_{Omega_{epsilon}}$ be the Neumann Laplacian and $f_{epsilon}$ be the restriction
Yoshimi Saito
doaj
On Trees with a Given Number of Vertices of Fixed Degree and Their Two Bond Incident Degree Indices
AxiomsThis paper is mainly concerned with the study of two bond incident degree (BID) indices, namely the variable sum exdeg index SEIa and the general zeroth-order Randić index Rα0.
Abeer M. Albalahi +6 more
doaj +1 more source
Auto-Configuration of ACL Policy in Case of Topology Change in Hybrid SDN
IEEE Access, 2016 Software-defined networking (SDN) has emerged as a new network architecture, which decouples both the control and management planes from data plane at forwarding devices.
Rashid Amin +3 more
doaj +1 more source
The Image of a Tree in F.M. Dostoyevsky's Novel "The Idiot" [PDF]
Достоевский и мировая культура: Филологический журнал, 2018 The article is devoted to the analysis of the image of a tree in Dostoevsky’s novel “The Idiot”. The author reflects on the evolution of this image from an artistic detail in the description of the Pavlovsk Park to the philosophical symbol of the Golden ...
Olga N. Smyslova
doaj +1 more source
Scientia Agropecuaria, 2014 Cocoa farming is one of the most important activities in the Peruvian Amazon. Its genetic basis is supported by the introduction of improved clones, so that the local genetic potential are in germplasm bank is not well used due to limited breeding study.
Carlos Oliva +4 more
doaj +1 more source
Special Matrices, 2019 Considered are combinatorially symmetric matrices, whose graph is a given tree, in view of the fact recent analysis shows that the geometric multiplicity theory for the eigenvalues of such matrices closely parallels that for real symmetric (and complex ...
Saiago Carlos M.
doaj +1 more source
Weakly connected domination critical graphs [PDF]
Opuscula Mathematica, 2008 A dominating set \(D \subset V(G)\) is a weakly connected dominating set in \(G\) if the subgraph \(G[D]_w = (N_{G}[D],E_w)\) weakly induced by \(D\) is connected, where \(E_w\) is the set of all edges with at least one vertex in \(D\).
Magdalena Lemańska, Agnieszka Patyk
doaj
Trees, Stumps, and Applications
Axioms, 2018 The traditional derivation of Runge–Kutta methods is based on the use of the scalar test problem y′(x)=f(x,y(x)). However, above order 4, this gives less restrictive order conditions than those obtained from a vector test problem using a tree-
John C. Butcher
doaj +1 more source
A posteriori GPR Evaluation of Tree Stability: A Case Study in Rome (Italy)
Remote Sensing, 2019 Following the frequent and harmful collapses of trees that have plagued the municipal territory of Rome in recent years, a protocol of understanding was initiated between the Department of Environmental Protection of ROMA CAPITALE, the American ...
Pier Matteo Barone, Carlotta Ferrara
doaj +1 more source
Changing and Unchanging 2-Rainbow Independent Domination
IEEE Access, 2019 Domination number is of practical interest in several theoretical and applied scenes. In the problem of wireless networking, the dominating idea is used to deduce an efficient route within the adhoc mobilenetworks.
Xiaolong Shi +6 more
doaj +1 more source