Results 81 to 90 of about 982,672 (306)

Eigenvalues of the perfect matching derangement graph

, 2023
The perfect matching derangement graph M2n is the graph whose vertex set consists of the perfect matchings of the complete graph K2n such that two vertices (perfect matchings) are adjacent if and only if they have no edges in common, i.e.
Koh, Samuel Zhi Kang
core   +1 more source

Four‐Year Cognitive Outcomes in Multiple Sclerosis: Associations With Lesion Myelin Integrity

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objectives Cognitive impairment is prevalent in patients with multiple sclerosis (MS) but whether lesion myelin integrity influences future cognitive outcomes remains unclear. We investigated the relationship between baseline lesion myelin water fraction (MWF) and cognitive performance 4 years later.
Iliana Pliska‐Bloch, Hannah Schwartz, Kimberly H. Markowitz, Abhishek Jaywant, Christopher D. Hildenbrand, Jai Perumal, Ulrike W. Kaunzner, Thanh D. Nguyen, Sandra Hurtado Rúa, Susan A. Gauthier   +9 more
wiley   +1 more source

Patients improve, patterns persist: longitudinal stability of RA joint involvement patterns

Arthritis Care &Research, Accepted Article.
Objective Rheumatoid arthritis is a heterogeneous disease. Data‐driven approaches, from synovial histology to joint involvement patterns (JIPs), have sought to define clinically meaningful subgroups. Whether these subgroups represent stable phenotypes or transient disease states remains unclear.
Tjardo Maarseveen, Yasuo Nagafuchi, Kristina Lend, Seyam Alemyar, Herman Kasper Glas, Gerdur Gröndal, Bjorn Gudbjornsson, Espen A. Haavardsholm, Kim Hørslev Petersen, Jon Lampa, Merete Lund Hetland, Dan Nordström, Mike Nurmohamed, Mikkel Østergaard, Anna Rudin, Marte Schrumpf Heiberg, Tuulikki Sokka‐Isler, Till Uhlig, Josien Veris‐van Dieren, Ronald van Vollenhoven, Tom Huizinga, Marcel JT Reinders, Sytske Anne Bergstra, Erik van den Akker, Rachel Knevel   +24 more
wiley   +1 more source

Some results on one type of graph family with some special number sequences

AKCE International Journal of Graphs and Combinatorics, 2020
In this study, we introduce a new graph family. Then, we calculate eigenvalues of the adjacency and the Laplacian matrix of this graph family. Moreover, we show that the perfect matching number of this graph family equals to special second order ...
Emrullah Kirklar, A. Dilek Maden, Fatih Yilmaz   +2 more
doaj   +1 more source

Quasi-Tree Graphs With Extremal General Multiplicative Zagreb Indices

IEEE Access, 2020
Zagreb indices and their modified versions of a molecular graph are important molecular descriptors which can be applied in characterizing the structural properties of organic compounds from different aspects. In this article, by exploring the structures
Jianwei Du, Xiaoling Sun
doaj   +1 more source

Perfect Matching Preservers

, 2004
For two bipartite graphs G and G 0, a bijection : E(G) ! E(G 0 is called a (perfect) matching preserver provided that M is a perfect matching in G if and only if (M) is a perfect matching in G
Richard A. Brualdi, Martin Loebl, et al.
core  

A Workflow to Accelerate Microstructure‐Sensitive Fatigue Life Predictions

Advanced Engineering Materials, EarlyView.
This study introduces a workflow to accelerate predictions of microstructure‐sensitive fatigue life. Results from frameworks with varying levels of simplification are benchmarked against published reference results. The analysis reveals a trade‐off between accuracy and model complexity, offering researchers a practical guide for selecting the optimal ...
Luca Loiodice, Krzysztof S. Stopka, Michael D. Sangid   +2 more
wiley   +1 more source

The labeled perfect matching in bipartite graphs

, 2006
In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = (V,E) with |V | = 2n vertices such that E contains a perfect matching (of size n), together with
Monnot, Jérôme
core   +1 more source

A Numerical–Experimental Approach for Multi‐Matrix Fiber‐Reinforced Plastics Characterization Using Finite Element Model Updating

Advanced Engineering Materials, EarlyView.
A numerical–experimental framework is developed for characterizing multi‐matrix fiber‐reinforced polymers (MM‐FRPs) combining epoxy and polyurethane matrices. Harmonic bending tests are integrated with finite element model updating (FEMU) to simultaneously identify elastic and viscoelastic material parameters.
Rodrigo M. Dartora, Tales V. Lisbôa, Axel Spickenheuer, Rogério J. Marczak, Jakson M. Vassoler   +4 more
wiley   +1 more source

Generalized Matching Preclusion in Bipartite Graphs

Theory and Applications of Graphs, 2018
The matching preclusion number of a graph with an even number of vertices is the minimum number of edges whose deletion results in a graph that has no perfect matchings. For many interconnection networks, the optimal such sets are precisely sets of edges
Zachary Wheeler, Eddie Cheng, Dana Ferranti, Laszlo Liptak, Karthik Nataraj   +4 more
doaj   +1 more source