Results 151 to 160 of about 919,081 (302)
Some Results on Divisior Cordial Graphs
In this paper, we introduce some results on divisor cordial graphs where we find some upper bound for the labeling of any simple graph and r-regular graph and describe the divisor cordial labeling for some families of graphs such the jellyfish graph ...
Shakir Salman, Mohammed Seoud
doaj
Game variants of graph labeling
A graph labeling on a graph G is a mapping from the vertex set or the edge set to a set of labels L ⊆ N ∪ {0}. We will survey the existing results on graph labeling games. We also introduce a new type of labeling - ESD labeling and its game variant which
Jedličková, Nikola
core
ABSTRACT Objective To evaluate the expression of nine blood RNA biomarkers in a clinical trial based on genes previously identified in an experimental monkey model of stroke for diagnosis feasibility and prognostication. Methods IBIS‐CT1 was a prospective longitudinal study enrolling patients with ischemic stroke (IS) or intracerebral hemorrhage (ICH ...
Salomé Retailleau +11 more
wiley +1 more source
A fundamental area of graph theory, graph labeling concerns the assignment of integers to the vertices, edges, or both of a graph under specified constraints. One of the many types of graph labeling is edge-graceful labeling.
John Rafael M. Antalan +3 more
doaj +1 more source
Radio Mean Labeling Of Paths And Its Total Graph
A graph labeling problem is an assignment of labels to the vertices or edges (or both) of a graph G satisfying some mathematical condition. Radio Mean Labeling, a vertex-labeling of graphs with non-negative integers has a significant application in the ...
et. al., Meera Saraswathi,
core
Arterial Spin‐Labeling MRI at the Cortical‐CSF Interface: A Novel Biomarker in Alzheimer Disease
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
Prime and Odd Prime Labelings on Cycle-Related Graphs
Graph labeling is the process of determining integer values for vertices, edges, or both, based on certain criteria. Let G be a simple graph with the finite vertex set V(G). Prime labeling of G is a bijection ⍺:V(G)→{1,2,…,|V(G)|} for which each pair of
Hafif Komarullah +3 more
doaj +1 more source
ABSTRACT Objective Progression independent of relapse activity is a major determinant of long‐term disability in multiple sclerosis, but its immunopathologic basis remains incompletely understood. We investigated whether relapse‐independent progression in radiologically stable relapsing–remitting multiple sclerosis is associated with distinct ...
Antonio Bruno +19 more
wiley +1 more source
We show that if a graph \(G\) on \(n\) edges allows certain special type of rosy labeling (a.k.a. \(\rho\)-labeling), called \(\alpha_2\)-labeling, then for any positive integer \(k\) the complete graph \(K_{2nk+1}\) can be decomposed into copies of \(G\). This notion generalizes the \(\alpha\)-labeling introduced in 1967 by A. Rosa.
openaire +1 more source
Objective We describe the frequency, risk factors, severity, and management of actionable and serious adverse events (AAE and SAE) in children with newly diagnosed Juvenile Idiopathic Arthritis (JIA) in Canada. Methods We enrolled patients within 3 months of JIA diagnosis in the Canadian Alliance of Pediatric Rheumatology Investigators (CAPRI) Registry,
Bashayer Alnuaimi +10 more
wiley +1 more source

