Results 41 to 50 of about 696,277 (238)

Prime labeling in the context of web graphs without center

open access: yesAKCE International Journal of Graphs and Combinatorics, 2021
A prime labeling on a graph G of order n is a bijection from the set of vertices of G into the set of first n positive integers such that any two adjacent vertices in G have relatively prime labels.
A. N. Kansagara, S. K. Patel
doaj   +1 more source

Spatial and single‐nuclei transcriptomics reveals idiosyncratic and generic patterns in papillary and anaplastic thyroid cancers

open access: yesMolecular Oncology, EarlyView.
Matched spatial transcriptomics and single‐nuclei RNA‐seq were generated for anaplastic and BRAFV600E papillary thyroid cancers revealing generic and tumor‐specific states occurring in cancer cells and in the tumor microenvironment. In this context, cancer dedifferentiation mirrored organoid maturation through ordered thyroid marker gain/loss ...
Adrien Tourneur   +11 more
wiley   +1 more source

Purification and preparation of Marchantia polymorpha Auxin Response Factor 2 for phase separation studies

open access: yesFEBS Open Bio, EarlyView.
We describe detailed protocols for the purification and preparation of Marchantia polymorpha Auxin Response Factor 2 (MpARF2). This protein is fused to an MBP solubility tag and an mNG fluorescent tag and is purified from Escherichia coli. The presented procedures make it possible to study MpARF2 assemblies, which could arise from phase separation ...
Bas Janssen   +5 more
wiley   +1 more source

Distance Spectra of Some Double Join Operations of Graphs

open access: yesInternational Journal of Mathematics and Mathematical Sciences
In literature, several types of join operations of two graphs based on subdivision graph, Q-graph, R-graph, and total graph have been introduced, and their spectral properties have been studied.
B. J. Manjunatha   +3 more
doaj   +1 more source

Blood RNA Biomarker Signatures for Early Diagnosis and Prognosis in Ischemic and Hemorrhagic Stroke: The IBIS‐CT1 Study

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
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

Folding List of Graphs Obtained from a Given Graph

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 2020
In this paper, we examine the relation between graph folding of a given graph and foldings of new graphs obtained from this graph by some techniques like dual, gear, subdivision, web, crown, simplex, crossed prism, and clique-sum graphs. In each case, we
E. M. El-Kholy, H. Ahmed
doaj   +1 more source

Autoimmune Comorbidities as Modifiers of Phenotypic Heterogeneity in Facioscapulohumeral Dystrophy

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Facioscapulohumeral dystrophy type 1 (FSHD1) shows clinical heterogeneity that is only partly explained by D4Z4 repeat unit (RU) size. Although immune and inflammatory mechanisms may contribute to disease variability, the prevalence and clinical impact of autoimmune diseases in FSHD remain unclear.
Jonathan Pini   +9 more
wiley   +1 more source

On Wiener Index for Generalised Subdivision Neighbourhood Corona of Graphs

open access: yesInternational Journal of Mathematics and Mathematical Sciences
Graph operations such as the corona product play a significant role in analysing and constructing complex networks. In this work, we examine the Wiener index within the framework of generalised subdivision graph operations.
Vimal M., M. K. Pandit, Kalaimurugan G.
doaj   +1 more source

Layouts of Graph Subdivisions

open access: yes, 2004
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges with respect to the vertex ordering. A k-track layout of a graph consists of
David R. Wood   +3 more
core   +1 more source

Roman game domination subdivision number of a graph [PDF]

open access: yesTransactions on Combinatorics, 2013
A {em Roman dominating function} on a graph $G = (V ,E)$ is a function $f : Vlongrightarrow {0, 1, 2}$ satisfying the condition that every vertex $v$ for which $f (v) = 0$ is adjacent to at least one vertex $u$ for which $f (u) = 2$. The {em weight} of a
Jafar Amjadi   +3 more
doaj  

Home - About - Disclaimer - Privacy