Results 111 to 120 of about 946,691 (269)
iMetaOmics, EarlyView.First use of a natural swine model with lipid metabolism to directly link lipid differences to a quantifiable intestinal villus height phenotype. Identified the phospholipid‐derived oleoylethanolamide, rather than canonical fatty acids, as the endogenous primary ligand that activates peroxisome proliferator‐activated receptors α (PPARα) to enlarge ...
Qianqian Wang +9 more
wiley +1 more source
Discrete Applied Mathematics, 2002 A chordally signed graph is defined as a signed chordal graph (each edge is designated as being positive or negative and every induced cycle is a triangle) in which every cycle \(C\) containing an even number of negative edges (positive cycles) has a chord \(e\) such that \(C\cup\{e\}\) forms two positive cycles.
openaire +1 more source
Journal of Periodontology, EarlyView.Abstract Background To examine whether the associations between periodontitis and multiple systemic conditions increase with increasing severity of periodontitis using a multi‐center electronic health record (EHR) repository. Methods A cross‐sectional analysis was conducted using EHR data from 9 dental schools in the United States.
Muhammad H. A. Saleh, Hamoun Sabri
wiley +1 more source
Vertex partitions of chordal graphs [PDF]
Journal of Graph Theory, 2006 AbstractA k‐tree is a chordal graph with no (k + 2)‐clique. An ℓ‐tree‐partition of a graph G is a vertex partition of G into ‘bags,’ such that contracting each bag to a single vertex gives an ℓ‐tree (after deleting loops and replacing parallel edges by a single edge).
openaire +2 more sources
PLANTS, PEOPLE, PLANET, EarlyView.Arboreta bridge people and nature while conserving tree biodiversity, supporting climate resilience, and advancing environmental education. This study maps over a century of available and indexed arboretum research, uncovering trends, knowledge gaps, and opportunities for collaboration.
Catarina Patoilo Teixeira +1 more
wiley +1 more source
A graph is locally chordal if, locally at each vertex, it is chordal, i.e. composed of cliques glued along a tree. In addition to extending many classic characterizations of chordal graphs, we show that locally chordal graphs are precisely those graphs $G$ which can be decomposed into cliques arranged in the shape of a high-girth graph.
Abrishami, Tara +3 more
openaire +2 more sources
Rapid Communications in Mass Spectrometry, EarlyView.ABSTRACT Rationale Ions trapped within a Penning cell (ICR) travel periodic orbits whose frequencies are dependent on their mass‐to‐charge ratio and the value of the magnetic field passing through the trap. Fourier transformation (FT‐ICR) decomposes the signal induced in the detection circuit by the rotation of the ions in the cell after the ...
Patrick Arpino, Michel Heninger
wiley +1 more source
Discussiones Mathematicae Graph Theory, 2016 We study domination between different types of walks connecting two non-adjacent vertices u and v of a graph (shortest paths, induced paths, paths, tolled walks).
Alcón Liliana
doaj +1 more source
On an edge partition and root graphs of some classes of line graphs
Electronic Journal of Graph Theory and Applications, 2017 The Gallai and the anti-Gallai graphs of a graph $G$ are complementary pairs of spanning subgraphs of the line graph of $G$. In this paper we find some structural relations between these graph classes by finding a partition of the edge set of the line ...
K Pravas, A. Vijayakumar
doaj +1 more source
Well-partitioned chordal graphs
Discrete Mathematics, 2022 Jungho Ahn +3 more
semanticscholar +1 more source