Results 111 to 120 of about 16,423 (156)

Plant-Soil-Microbe Interactions Along a Salinity Gradient in the Songnen Plain Grasslands. [PDF]

Microorganisms
Li H, Zhu W, Hu T, Chen Y, Han Z, Xiao H, Qin L, Mei L.   +7 more
europepmc   +1 more source

Biodiversity and Conservation of Marine Mollusks in the Indo-Pacific Convergence Zone. [PDF]

Ecol Evol
Lai X, Li T, Cong B, Pitriana P, Wang B, Zhao L, Liu S.   +6 more
europepmc   +1 more source

Symbiotic soil fungi mitigate nitrogen-driven methane emissions in an experimental grassland. [PDF]

Front Microbiol
Jia Y, Duan W, Wang H, Li W, Cao W, Zhang F, Liu W.   +6 more
europepmc   +1 more source

Dynamic evaluation of waterfowl habitat quality based on an integrated multi-indicator framework and habitat function enhancement strategies in Xianghai Nature Reserve. [PDF]

Sci Rep
Wu C, Yan Y, Liu J.
europepmc   +1 more source

Freeze-Thaw Damage of Coal Gangue-Iron Tailings Sintered Porous Bricks in Cold Region Environments. [PDF]

Materials (Basel)
Li J, Lu S, Liu J, Fan S, Tang J, Li S, Li Z, Ren S, Liu Z.   +8 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On Wiener index and Wiener polarity index of some polyomino chains

Journal of Discrete Mathematical Sciences and Cryptography, 2019
AbstractA graph invariant is a numerical value that depicts the structural properties of an entire graph.
Sarfraz Ahmad, Muhammad Kamran Siddiqui, Mohammad Reza Farahani   +2 more
exaly   +3 more sources

COMPUTATION OF WIENER INDEX, RECIPROCAL WIENER INDEX AND PERIPHERAL WIENER INDEX USING ADJACENCY MATRIX

South East Asian J. of Mathematics and Mathematical Sciences, 2022
In this short paper, we establish formulae to compute Wiener index, reciprocal Wiener index and peripheral Wiener index of graphs using adjacency matrix.
Rajendra, R., Reddy, P. Siva Kota, Prabhavathi, M.   +2 more
openaire   +2 more sources

Wiener index and Steiner 3-Wiener index of graphs

Asian-European Journal of Mathematics, 2021
Let [Formula: see text] be a set of vertices of a connected graph [Formula: see text]. The Steiner distance of [Formula: see text] is the minimum size of a connected subgraph of [Formula: see text] containing all the vertices of [Formula: see text].
Kovše, Matjaž, Rasila, V. A., Vijayakumar, Ambat   +2 more
openaire   +1 more source