Results 51 to 60 of about 34,690 (269)
Breaking Symmetries in Graph Representation [PDF]
, 2013 There are many complex combinatorial problems which involve searching for an undirected graph satisfying a certain property. These problems are often highly challenging because of the large number of isomorphic representations of a possible solution.
Codish, M. +3 more
core
, 2016 Tur\'{a}n's theorem is a cornerstone of extremal graph theory. It asserts that for any integer $r \geq 2$ every graph on $n$ vertices with more than ${\tfrac{r-2}{2(r-1)}\cdot n^2}$ edges contains a clique of size $r$, i.e., $r$ mutually adjacent ...
Reiher, Christian
core +1 more source
Relationship Between Neurologic Symptoms and Signs and FMR1 Genotype in Premutation Carriers
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Background and Objectives Fragile X‐associated Tremor/Ataxia Syndrome (FXTAS) is the most severe late‐onset condition caused by a premutation in the FMR1 gene, characterized by expanded CGG triplet repeats of 55–200. Clinical presentations of FXTAS, including gait ataxia, kinetic tremor, cognitive decline, and rare Parkinsonism, are linked to ...
Flora Tassone +8 more
wiley +1 more source
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Facioscapulohumeral muscular dystrophy (FSHD) is one of the most debilitating and common muscular dystrophies. Despite its severity, no approved therapy exists for FSHD patients. However, several therapeutic candidates are currently under development, and some have recently entered clinical trials, marking the need for reliable ...
Mustafa Bilal Bayazit +11 more
wiley +1 more source
Edge-Removal and Non-Crossing Configurations in Geometric Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 Graphs and ...
Oswin Aichholzer +7 more
doaj +1 more source
On Bond Incident Degree Indices of Chemical Graphs
Mathematics, 2022 By swapping out atoms for vertices and bonds for edges, a graph may be used to model any molecular structure. A graph G is considered to be a chemical graph in graph theory if no vertex of G has a degree of 5 or greater.
Abeer M. Albalahi +6 more
doaj +1 more source
Regularity lemmas in a Banach space setting
, 2015 Szemer\'edi's regularity lemma is a fundamental tool in extremal graph theory, theoretical computer science and combinatorial number theory. Lov\'asz and Szegedy [L. Lov\'asz and B.
Regts, Guus
core +2 more sources
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Down syndrome regression disorder is a syndrome characterized by subacute loss of cognitive, behavioral, and functional abilities in individuals with Down syndrome. Electroencephalography abnormalities are frequently observed during evaluation, but it remains unclear whether these findings represent a dynamic marker of disease ...
Jonathan D. Santoro +14 more
wiley +1 more source
Graph Theory and Qubit Information Systems of Extremal Black Branes
, 2014 Using graph theory based on Adinkras, we consider once again the study of extremal black branes in the framework of quantum information. More precisely, we propose a one to one correspondence between qubit systems, Adinkras and certain extremal black ...
Belhaj, Adil +2 more
core +1 more source
Arthritis Care &Research, EarlyView.Objective Knee osteoarthritis (OA) commonly affects individuals with type 2 diabetes (T2DM) and is associated with increased risk of diabetes‐related complications. To better understand potential mechanisms, we examined the association between symptomatic knee OA and glycemic control in individuals with T2DM.
Lauren K. King +10 more
wiley +1 more source