Results 1 to 10 of about 285,330 (265)
Connecting infinity to soft factors
In this note we study tree-level scattering amplitudes of gravitons under a natural deformation which in the large z limit can be interpreted either as a k-hard-particle limit or as a (n − k)-soft-particle limit. When k = 2 this becomes the standard BCFW
Freddy Cachazo, Pablo Leon
doaj +3 more sources
The Concept of Domicile in Matrimonial Causes in Nigeria: A Critique of the Status Quo
Proof of domicile is a condition precedent to the assumption of jurisdiction by High Courts in Nigeria. Under the Nigerian legal framework, it is the husband's domicile that matters in matrimonial causes.
Abiodun Odusote
doaj +7 more sources
Connected Factors in Graphs ? a Survey [PDF]
A subgraph \(F\) of a graph \(G\) is called a factor of \(G\) if \(V(F)= V(G)\) and \(E(F)\subseteq E(G)\). In other words \(F\) is a spanning subgraph of \(G\). A survey of factors of \(G\) that add additional restrictions on \(F\) are studied in this paper. For example, if \(f\) is a function from \(V(G)\) into the nonnegative integers, then \(F\) is
Vestergaard, Preben Dahl +1 more
openaire +3 more sources
Key factors for connecting silver-based icosahedral superatoms by vertex sharing
Icosahedron-based M13 nanoclusters are common building blocks to produce atomically precise superatomic molecules, but our understanding of the chemistry governing the connection between icosahedral M13 units is limited. Here, the key factors influencing
Sayuri Miyajima +8 more
doaj +1 more source
An update on the bridging factors connecting autophagy and Nrf2 antioxidant pathway
Macroautophagy/autophagy is a lysosome-dependent catabolic pathway for the degradation of intracellular proteins and organelles. Autophagy dysfunction is related to many diseases, including lysosomal storage diseases, cancer, neurodegenerative diseases ...
Baike Ning +5 more
doaj +1 more source
Approximability of Connected Factors [PDF]
Finding a d-regular spanning subgraph (or d-factor) of a graph is easy by Tutte's reduction to the matching problem. By the same reduction, it is easy to find a minimal or maximal d-factor of a graph. However, if we require that the d-factor is connected, these problems become NP-hard - finding a minimal connected 2-factor is just the traveling ...
Kamiel Cornelissen +4 more
openaire +4 more sources
Stress and Displacement Intensity Factors of Cracks in Anisotropic Media
A relation connecting stress intensity factors (SIF) with displacement intensity factors (DIF) at the crack front is derived by solving a pseudodifferential equation connecting stress and displacement discontinuity fields for a plane crack in an elastic ...
S. Kuznetsov, A. Karakozova
doaj +1 more source
Connected k-factors in bipartite graphs
Let $k,l$ be two positive integers. An $S_{k,l}$ is a graph obtained from disjoint $K_{1,k}$ and $K_{1,l}$ by adding an edge between the $k$-degree vertex in $K_{1,k}$ and the $l$-degree vertex in $K_{1,l}$. An {\em $S_{k,l}$-free} graph is a graph containing no induced subgraph isomorphic to $S_{k,l}$.
Yandong Bai, Binlong Li
openaire +3 more sources
Connecting Factor of Habitual Residence at EU and Iranian Conflicting Rules [PDF]
Connecting Factor of Habitual Residence at EU and Iranian Conflicting Rules In EU Law, habitual residence is an important connecting factor in relation to conflict of forums and conflict of laws, particularly in personal matters. EU rules and regulation,
رضا مقصودی
doaj +1 more source
Risk factors for pediatric glioma [PDF]
Brain tumours are a heterogenic group, a subtype of which is arising from glial cells. Pediatric low-grade gliomas are the most common primary CNS tumour group in childhood, representing 25% to over 30% of pediatric CNS tumours.
Georgios Sioutas +2 more
doaj +3 more sources

