Results 71 to 80 of about 147,831 (333)
A graph \(G\) is randomly planar if every planar embedding of every connected subgraph \(H\) of \(G\) can be extended to a planar embedding of \(G\). Intuitively, a graph is randomly planar if a planar embedding of it can be built up in any manner whatsoever.
Daniel C. Isaksen, David Petrie Moulton
openaire +3 more sources
Altered Dynamic Functional Network Connectivity in Post‐Stroke Aphasia
ABSTRACT Objective Previous studies examining post‐stroke aphasia (PSA) patients via resting‐state functional magnetic resonance imaging (rs‐fMRI) have predominantly focused on static functional connectivity. In contrast, the current investigation aims to elucidate the alterations in dynamic functional network connectivity (dFNC) among PSA patients ...
Guihua Xu+6 more
wiley +1 more source
Light Graphs In Planar Graphs Of Large Girth
A graph H is defined to be light in a graph family 𝒢 if there exist finite numbers φ(H, 𝒢) and w(H, 𝒢) such that each G ∈ 𝒢 which contains H as a subgraph, also contains its isomorphic copy K with ΔG(K) ≤ φ(H, 𝒢) and ∑x∈V(K) degG(x) ≤ w(H, 𝒢).
Hudák Peter+3 more
doaj +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
R. Sritharan+2 more
openaire +2 more sources
The Immobilization of Hyaluronic Acid in 3D Hydrogel Scaffolds Modulates Macrophage Polarization
This study explores the use of collagen‐hyaluronic acid (HA) hydrogels for the 3D culture of macrophages, providing a useful tool for modelling macrophage behavior in tissues and diseases. It highlights how hydrogel composition, mechanical properties, and preparation methods influence macrophage behavior, revealing for the first time that HA's ...
Tiah CL Oates+7 more
wiley +1 more source
Statistics of Feynman amplitudes in ϕ 4-theory
The amplitude of subdivergence-free logarithmically divergent Feynman graphs in ϕ 4-theory in 4 spacetime dimensions is given by a single number, the Feynman period. We numerically compute the periods of 1.3 million completed graphs, this represents more
Paul-Hermann Balduf
doaj +1 more source
On edge-group choosability of graphs [PDF]
In this paper, we study the concept of edge-group choosability of graphs. We say that G is edge k-group choosable if its line graph is k-group choosable. An edge-group choosability version of Vizing conjecture is given.
Khamseh, Amir, Omidi, Gholamreza
core
Infrared (IR) light evokes distinct calcium and water transport responses in astrocytes, depending on stimulation duration and protocol. This study uses widefield imaging and pharmacology to reveal differential engagement of astroglial signaling pathways.
Wilson R. Adams+7 more
wiley +1 more source
On the Synthesis of Planar Graphs with Given Properties
The problem of studying the structural properties of planar subgraphs G\v, where v is an arbitrary vertex of a graph G of undirected genus, is considered, using cell chains that connect limit cycles with points of a given set M of the graph G\v.
Volodymyr Petrenjuk, Dmytro Petreniuk
doaj +1 more source
About Structure of Graph Obstructions for Klein Surface with 9 Vertices
The structure of the 9 vertex obstructive graphs for the nonorientable surface of the genus 2 is established by the method of (-transformations of the graphs.
V.I. Petrenjuk, D.A. Petrenjuk
doaj +1 more source