Results 251 to 260 of about 836 (298)

Gall responses to drying habitats: Insights from the community of galling herbivores associated with the superhost Caryocar brasiliense Cambess. (Caryocaraceae)

open access: yesPlant Biology, EarlyView.
Drying processes in the Brazilian palm swamps or Veredas, impact the gall community in adjacent vegetation by reducing the abundance of more sensitive galls, while more resilient galls acclimate to increased dryness by developing thicker protective tissues. Abstract Galls are new plant organs formed in response to the stimuli of gall‐inducing organisms,
I. S. Fernandes   +2 more
wiley   +1 more source

Integrative single-cell metabolomics and phenotypic profiling reveals metabolic heterogeneity of cellular oxidation and senescence. [PDF]

open access: yesNat Commun
Wang Z   +11 more
europepmc   +1 more source

Tai Chi Practice Buffers Aging Effects in Functional Brain Connectivity. [PDF]

open access: yesBrain Sci
Cerna J   +5 more
europepmc   +1 more source

On growth and form of animal behavior. [PDF]

open access: yesFront Integr Neurosci
Golani I, Kafkafi N.
europepmc   +1 more source

Healthcare insurance fraud detection using data mining. [PDF]

open access: yesBMC Med Inform Decis Mak
Hamid Z   +5 more
europepmc   +1 more source

A deep-learning strategy to identify cell types across species from high-density extracellular recordings

open access: yes
Beau M   +22 more
europepmc   +1 more source

Graceful Cascading Labelling Algorithm: Construction of Graceful Labelling of Trees

2021 2nd International Conference on Robotics, Electrical and Signal Processing Techniques (ICREST), 2021
The Graceful Labelling of trees is one of the most challenging conjectures in Graph Theory, proudly known as the 'Disease' of Graph Theory which remains a challenge as it remains unsolved. To counter the conjecture, an algorithm is proposed to construct a Graceful Binary Tree and a Graceful Caterpillar Tree.
Dipta Gomes, Md. Manzurul Hasan
openaire   +1 more source

ODD GRACEFUL LABELINGS OF GRAPHS

Discrete Mathematics, Algorithms and Applications, 2009
A graph G = (V(G), E(G)) with q edges is said to be odd graceful if there exists an injection f from V(G) to {0, 1, 2, …, 2q - 1} such that the edge labeling set is {1, 3, 5, …, 2q - 1} with each edge xy assigned the label |f(x) - f(y)|. In this paper, we prove that Pn × Pm (m = 2, 3, 4), generalized crown graphs Cn ⊙ K1,t and gear graphs are odd ...
Gao, Zhen-Bin   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy