Results 211 to 220 of about 25,210 (236)

Biomimetic astragaloside-IV-loaded mesoporous silica nanoparticles for treatment of dilated cardiomyopathy. [PDF]

Front Pharmacol
Wang C, Lv L, Long T, Xie T, Qi J, Pan H, Fang Y, Sun Y.   +7 more
europepmc   +1 more source

Impact of shared spaces and daily routines on shared microbiome. [PDF]

Sci Rep
Lee H, Lee S, Hyun S.
europepmc   +1 more source

Extended Barrier Precautions vs Hand Hygiene Alone and Neonatal Sepsis in Intensive Care Patients: The BALTIC Cluster-Randomized Clinical Trial.

JAMA Netw Open
Faust K, Strecker F, Haug C, Felderhoff-Müser U, Stein A, Jensen R, Fortmann MI, Marißen J, Silwedel C, Brebach K, Frommhold D, Wieg C, Hillebrand G, Naust B, Schmidt E, Koch L, Schmidtke S, Simon A, Zemlin M, Meyer S, Scholzen C, Köstlin-Gille N, Gille C, Longardt AC, Göpel W, Krone M, Kampmeier S, Nurjadi D, Herting E, Rupp J, König IR, Härtel C.   +31 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Balancing transmission properties in regular and irregular graph-based networks by controlling transmission resources

2023 16th International Conference on Signal Processing and Communication System (ICSPCS), 2023
Slawomir Bujnowski, Zbigniew Lutowski, Adam Flizikowski   +2 more
openaire   +3 more sources

Distance Spectral Radius of Some k-partitioned Transmission Regular Graphs

2016
The distance matrix of a simple graph G is $$DG=d_{i,j}$$, where $$d_{i,j}$$ is the distance between the ith and jth vertices of G. The distance spectral radius of G, written $$\lambda _{1}G$$, is the largest eigenvalue of DG. We determine the distance spectral radius of the wheel graph $$W_{n}$$, a particular type of spider graphs, and the generalized
Fouzul Atik, Pratima Panigrahi
openaire   +1 more source

Generalized distance spectral radius of some t-partitioned transmission regular graphs

Asian-European Journal of Mathematics
Let [Formula: see text] be an [Formula: see text]-vertex connected graph with the distance matrix [Formula: see text] and the diagonal matrix of transmissions [Formula: see text]. The generalized distance matrix of a connected graph [Formula: see text] is [Formula: see text], where [Formula: see text], [Formula: see text].
Aditi Howlader, Pratima Panigrahi
openaire   +1 more source

The method of determining of transmission properties of networks based on regular graphs topology

Zeszyty Naukowe, Telekomunikacja i Elektronika, Scientific Journal, Telecommunications and Electronics, 2014
Ledziński, Damian, Śmigiel, Sandra, Śrutek, Mścisław   +2 more
openaire   +1 more source

A walk-regular graph, cospectral to its complement, need not be strongly regular

Discrete Mathematics, 2023
Sanja Stevanovic, Dragan Stevanovic
exaly