Results 221 to 230 of about 423,962 (267)

Topological Structure of Epigenetic Forests in Flower Morphogenesis. [PDF]

Bull Math Biol
Cortés-Poza Y, Pérez-Buendía JR.
europepmc   +1 more source

Is Rituximab Suitable for Patients with Idiopathic Membranous Nephropathy Who are Seronegative for Anti-PLA2R Antibody? [PDF]

Drug Des Devel Ther
Yang Y, Xie X, Yuan F, Zeng F, Wang Y, Zhang R, Yan W, Luo K, Ren D, Xu G.   +9 more
europepmc   +1 more source

Macronutrient deficiency reduces growth and influences vegetation indices of greenhouse grown ornamental and vegetable plants as measured by the TraitFinder digital phenotyping system. [PDF]

Front Plant Sci
Quijia-Pillajo J, Maurya J, Chapin LJ, Jones ML.   +3 more
europepmc   +1 more source

Modeling and Dynamic Analysis of Trust Decay in Social Media Based on Triadic Closure Structure. [PDF]

Entropy (Basel)
Qu Y, Wang C, Tian Q.
europepmc   +1 more source

ETX2Vec: a fraud detection algorithm for ethereum based on temporal biased random walk strategy. [PDF]

Sci Rep
Lu J, Liao B, Liu Y, Zhong L.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Completely Disconnecting the Complete Graph

SIAM Journal on Discrete Mathematics, 2000
Let \(\omega \in {\mathbb{N}} \cup \{\infty\}\). By ``completely disconnecting a graph \(G\)'' the authors mean a sequence \(G= G_0, G_1, \ldots, G_t\) of spanning subgraphs of \(G\) where \(G_t\) has no edge and \(G_{i+1}\) is obtained from \(G_i\) by deleting at most \(\omega\) edges with no more than one edge being deleted from any connected ...
John Ginsburg, Bill Sands
openaire   +1 more source

On a Decomposition of Complete Graphs

Graphs and Combinatorics, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hadi Kharaghani, Rouzbeh Torabi
openaire   +1 more source

On the Decomposition of Graphs into Complete Bipartite Graphs

Graphs and Combinatorics, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jinquan Dong, Yanpei Liu
openaire   +2 more sources

Detachments of Complete Graphs

Combinatorics, Probability and Computing, 2005
A detachment of a graph $G$ is formed by splitting each vertex into one or more subvertices, and sharing the incident edges arbitrarily among the subvertices. In this paper we consider the question of whether a graph $H$ is a detachment of some complete graph $K_n$.
openaire   +2 more sources