Results 81 to 90 of about 196,625 (294)
The reducibility of optimal 1-planar graphs
17 ...
Zhang, Licheng, Huang, Yuanqiu
openaire +2 more sources
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
The unrolling of the peltate leaves in Syngonium podophyllum is analyzed and quantified (left‐hand side to center). These measurements serve to verify a mathematical model for leaf unrolling based on the model used in Schmidt (2007). An additional formula for obtaining a layer mismatch from a prescribed radius is derived.
Michelle Modert +4 more
wiley +1 more source
Fast simulation of planar Clifford circuits [PDF]
A general quantum circuit can be simulated classically in exponential time. If it has a planar layout, then a tensor-network contraction algorithm due to Markov and Shi has a runtime exponential in the square root of its size, or more generally ...
David Gosset +3 more
doaj +1 more source
Neighbor Sum Distinguishing Total Choosability of IC-Planar Graphs
Two distinct crossings are independent if the end-vertices of the crossed pair of edges are mutually different. If a graph G has a drawing in the plane such that every two crossings are independent, then we call G a plane graph with independent crossings
Song Wen-Yao +2 more
doaj +1 more source
In this study, exciting new bi‐/multi‐linear elastic behavior of soft elastic composites that accompany the activation of wrinkling in the embedded interfacial layers is analyzed. The new features and performance of these composite materials, including dramatic enhancements in energy storage, can be tailored by the concentration of interfacial layers ...
Narges Kaynia +2 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
Regularity and Planarity of Token Graphs
Let G = (V, E) be a graph of order n and let 1 ≤ k < n be an integer. The k-token graph of G is the graph whose vertices are all the k-subsets of V, two of which are adjacent whenever their symmetric difference is a pair of adjacent vertices in G.
Carballosa Walter +3 more
doaj +1 more source
ErB4 and NdB4 nanostructured powders are produced by mechanochemical synthesis. 5 h mechanical alloying and 4 M HCl acid leaching are used in the production. ErB4 and NdB4 powders exhibit maximum magnetization of 0.4726 emu g−1 accompanied with an antiferromagnetic‐to‐paramagnetic phase transition at about TN = 18 K and 0.132 emu g−1 with a maximum at ...
Burçak Boztemur +5 more
wiley +1 more source
A note on the coprime graph of a group [PDF]
In this paper we study the coprime graph of a group $G$. The coprime graph of a group $G$, is a graph whose vertices are elements of $G$ and two distinct vertices $x$ and $y$ are adjacent iff $(|x|,|y|)=1$.
Hamid Reza Dorbidi
doaj

