Results 171 to 180 of about 3,842,374 (234)

Quantification of the radiative forcing of contrails embedded in cirrus clouds. [PDF]

Nat Commun
Seelig T, Wolf K, Bellouin N, Tesche M.
europepmc   +1 more source

Rapid subsurface warming in the subpolar North Atlantic from freshening. [PDF]

Nat Commun
Menviel LC, Pontes G, Lapeze M, Saini H.
europepmc   +1 more source

An Energy-Efficient LiDAR Receiver Using Time-to-Voltage Converter and SAR ADC in 180 nm CMOS. [PDF]

Micromachines (Basel)
Seo B, Park SM.
europepmc   +1 more source

Ocean heat forced West Antarctic Ice Sheet retreat after the Last Glacial Maximum. [PDF]

Nat Commun
Mawbey EM, Smith JA, Hillenbrand CD, Hendry KR, McClymont EL, Greaves MJ, Klages JP, Kuhn G, Radionovskaya S, Spencer-Jones CL, Larter RD, Wellner JS, Dutrieux P.   +12 more
europepmc   +1 more source

Modelling of magnetic vortex microdisc dynamics under varying magnetic field in biological viscoelastic environments. [PDF]

Nanoscale Adv
Visonà A, Morel R, Joisten H, Dieny B, Nicolas A.   +4 more
europepmc   +1 more source

Reduced-order modeling of solute transport within physiologically realistic solid tumor microenvironment. [PDF]

Front Pharmacol
Akash MMH, Yeasin M, Mahmoudirad S, Niloy RA, Mohammad J, Reindl K, Pandey A, Basu S.   +7 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

The forcing edge covering number of a graph

Journal of Discrete Mathematical Sciences and Cryptography, 2011
Abstract An edge covering of G is a subset S ⊆ E (G) such that each vertex of G is end of some edge in S. The number of edges in a minimum edge covering of G, denoted by β’ (G) is the edge covering number of G. A subset T ⊆ S is called a forcing subset for S if S is the unique minimum edge covering containing T.
J. John, A. Vijayan, S. Sujitha
exaly   +3 more sources

The Forcing Edge Fixed Monophonic Number of a Graph

Asian Journal of Research in Social Sciences and Humanities, 2016
For an edge xy in a connected graph G of order p ≥ 3, a set S ⊆ V (G) is an xy-monophonic set of G if each vertex v ∈ V (G) lies on either an x-u monophonic path or an y-u monophonic path for some element u in S. The minimum cardinality of an xy-monophonic set of G is the xy-monophonic number of G and is denoted by mxy(G).
P. Titus, S. Vanaja
exaly   +3 more sources