Results 71 to 80 of about 982,672 (306)
Commuting decomposition of Kn1,n2,...,nk through realization of the product A(G)A(GPk )
Special Matrices, 2018 In this paper, we introduce the notion of perfect matching property for a k-partition of vertex set of given graph. We consider nontrivial graphs G and GPk , the k-complement of graph G with respect to a kpartition of V(G), to prove that A(G)A(GPk ) is ...
Bhat K. Arathi, Sudhakara G.
doaj +1 more source
All Pairs of Pentagons in Leapfrog Fullerenes Are Nice
Mathematics, 2020 A subgraph H of a graph G with perfect matching is nice if G−V(H) has perfect matching. It is well-known that all fullerene graphs have perfect matchings and that all fullerene graphs contain some small connected graphs as nice subgraphs.
Tomislav Došlić
doaj +1 more source
Deep Learning Pose Estimation for Phenotyping of Co‐Occurring Hyperkinetic Movement Disorders
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective To explore whether routine outpatient video combined with deep learning‐based pose estimation and clinically interpretable kinematic features can support multi‐label phenotyping of co‐occurring hyperkinetic movement disorders (HMDs).
Laura Cif +17 more
wiley +1 more source
A sharp lower bound on the signless Laplacian index of graphs with (κ,τ)-regular sets
Special Matrices, 2018 A new lower bound on the largest eigenvalue of the signless Laplacian spectra for graphs with at least one (κ,τ)regular set is introduced and applied to the recognition of non-Hamiltonian graphs or graphs without a perfect matching.
Andeelić Milica +2 more
doaj +1 more source
Arterial Spin‐Labeling MRI at the Cortical‐CSF Interface: A Novel Biomarker in Alzheimer Disease
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Background/Objective Arterial spin‐labeling (ASL) MRI can measure perfusion signal adjacent to CSF spaces and may provide information regarding CSF‐adjacent water transport physiology. We developed an automated pipeline to extract cortical‐CSF interface (IF) perfusion for comparison between Alzheimer disease (AD) and cognitively normal ...
Mona Asghariahmadabad +22 more
wiley +1 more source
Posterior Disconnection Syndrome in Early‐Stage Adult‐Onset Cerebral Adrenoleukodystrophy
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Adult‐onset cerebral adrenoleukodystrophy is potentially treatable but often difficult to recognize before advanced cerebral involvement. Herein, we describe three men with early‐stage disease who initially presented with subtle visual complaints rather than subcortical dementia. Targeted neuropsychological testing revealed higher‐order visual
Kazuto Katsuse +13 more
wiley +1 more source
A Generalized Hypergreedy Algorithm for Weighted Perfect Matching [PDF]
, 1993 We give a generalization of the hypergreedy algorithm for minimum weight perfect matching on a complete edge weighted graph whose weights satisfy the triangle ...
Imielinska, Celina Z., Kalantari, Bahman
core +1 more source
A Two‐Stage Plasma Biomarker Algorithm Reduces Amyloid PET Use and the p‐Tau217 Gray Zone
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Plasma p‐Tau217 leaves 30%–50% of patients in an indeterminate “gray zone” often requiring Aβ‐PET. We developed GRAD (Gatekeeper‐Reflex for Alzheimer's Disease), a two‐stage Aβ‐positivity prediction model to improve classification while reserving Aβ‐PET for residual uncertainty.
Harthik Parankusham +7 more
wiley +1 more source
On the reconstraction of the matching polynomial and the reconstruction conjecture
International Journal of Mathematics and Mathematical Sciences, 1987 Two results are proved. (i) It is shown that the matching polynomial is both node and edge reconstructable. Moreover a practical method of reconstruction is given.
E. J. Farrell, S. A. Wahid
doaj +1 more source
On the bipartite unique perfect matching problem
, 2006 Lovász has posed the question of whether the problem of testing if a graph has precisely one perfect matching is in NC. This unique perfect matching question has been answered positively by Kozen, Vazirani, and Vazirani for bipartite graphs.
Meena Mahajan +2 more
core +1 more source