Results 51 to 60 of about 211,073 (326)

Altered Dynamic Functional Network Connectivity in Post‐Stroke Aphasia

Annals of Clinical and Translational Neurology, EarlyView.
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, Yongsheng Wu, Junyu Qu, Rui Zhu, Wenwen Xu, Jiaxiang Xin, Dawei Wang   +6 more
wiley   +1 more source

The Relationship Between Inflammation and Central Nervous System in Multiple Sclerosis

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Aim Multiple sclerosis is an autoimmune demyelination disease that is seen especially in the young population and has a progressive course, causing motor, sensory, and cognitive deficits. In the literature, the pathogenesis of MS disease and the interconnection between the immune and central nervous system in the disease have not been fully ...
Gamze Ansen, Ali Behram Salar, Abdulkadir Ermis, Erkingul Birday, Lutfu Hanoglu, Bayram Ufuk Sakul   +5 more
wiley   +1 more source

Treewidth 2 in the Planar Graph Product Structure Theorem [PDF]

Discrete Mathematics & Theoretical Computer Science
We prove that every planar graph is contained in $H_1\boxtimes H_2\boxtimes K_2$ for some graphs $H_1$ and $H_2$ both with treewidth 2. This resolves a question of Liu, Norin and Wood [arXiv:2410.20333]. We also show this result is best possible: for any
Marc Distel, Kevin Hendrey, Nikolai Karol, David R. Wood, Jung Hon Yip   +4 more
doaj   +1 more source

On Computation of Degree-Based Entropy of Planar Octahedron Networks

Journal of Function Spaces, 2022
Chemical graph theory is the combination of mathematical graph theory and chemistry. To analyze the biocompatibility of the compounds, topological indices are used in the research of QSAR/QSPR studies.
Tian-Le Sun, Haidar Ali, Bilal Ali, Usman Ali, Jia-Bao Liu, Parvez Ali   +5 more
doaj   +1 more source

The Weisfeiler-Leman Dimension of Planar Graphs is at most 3

, 2017
We prove that the Weisfeiler-Leman (WL) dimension of the class of all finite planar graphs is at most 3. In particular, every finite planar graph is definable in first-order logic with counting using at most 4 variables.
Kiefer, Sandra, Ponomarenko, Ilia, Schweitzer, Pascal   +2 more
core   +1 more source

Mechanochemical Synthesis and Characterization of Nanostructured ErB4 and NdB4 Rare‐Earth Tetraborides

Advanced Engineering Materials, Volume 27, Issue 6, March 2025.
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, Faruk Kaya, Bora Derin, Mustafa Lütfi Öveçoğlu, Ju Li, Duygu Ağaoğulları   +5 more
wiley   +1 more source

Near-colorings: non-colorable graphs and NP-completeness [PDF]

, 2013
A graph G is (d_1,..,d_l)-colorable if the vertex set of G can be partitioned into subsets V_1,..,V_l such that the graph G[V_i] induced by the vertices of V_i has maximum degree at most d_i for all 1
Montassier, Mickael, Ochem, Pascal
core  

Micromechanical Characterization of 316L‐V4E Steel Transitions Produced by Electron Beam Powder Bed Fusion with Dual‐Hopper Alternating Layer Strategy

Advanced Engineering Materials, EarlyView.
This work applies High‐Speed Nanoindentation to study multi‐material transitions in powder bed fusion–electron beam melting components. The aim is to assess the mechanical gradients and interfacial behavior between American iron and steel institute 316L stainless steel and V4E tool steel in additively manufactured structures.
Laia Ortiz‐Membrado, William Sjöström, Francesc Barberà Flichi, Carlos Botero, Anton S. Tremsin, Antonio Mateo, Emilio Jiménez‐Piqué   +6 more
wiley   +1 more source

A Planarity Test via Construction Sequences

, 2012
Optimal linear-time algorithms for testing the planarity of a graph are well-known for over 35 years. However, these algorithms are quite involved and recent publications still try to give simpler linear-time tests.
A.K. Kelmans, B. Haeupler, C. Gutwenger, C. Thomassen, H. Fraysseix de, H. Whitney, H.N. Djidjev, J.E. Hopcroft, J.E. Hopcroft, J.M. Boyer, J.M. Schmidt, K. Mehlhorn, K.-P. Vo, K.-P. Vo, K.S. Booth, N. Chiba, R. Tamassia, R.M. McConnell, S. McLane, U. Brandes, W.K. Shih   +20 more
core   +2 more sources

Strip Planarity Testing for Embedded Planar Graphs [PDF]

Algorithmica, 2016
In this paper we introduce and study the strip planarity testing problem, which takes as an input a planar graph $G(V,E)$ and a function $ :V \rightarrow \{1,2,\dots,k\}$ and asks whether a planar drawing of $G$ exists such that each edge is monotone in the $y$-direction and, for any $u,v\in V$ with $ (u)
Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati   +3 more
openaire   +3 more sources