Results 31 to 40 of about 1,058,735 (299)

Irredundancy in circular arc graphs

open access: yesDiscrete Applied Mathematics, 1993
An open neighbourhood of a vertex \(x\) in an undirected graph \(G\) is the set \(N(x)\) of all vertices adjacent to \(x\) in \(G\); its closed neighbourhood is \(N[x]=N(x) \cup \{x\}\). For a set \(S\) of vertices set \(N(S)=\bigcup_{x \in S}N(x)\) and \(N[S]=\bigcup_{x \in S} N[x]\). A subset \(X\) of the vertex set of \(G\) is called irredundant (or
Martin Charles Golumbic, Renu C. Laskar
openaire   +2 more sources

MagmaFlow: A desktop platform for artificial intelligence‐driven expression analysis

open access: yesFEBS Open Bio, EarlyView.
MagmaFlow is a free, no‐code platform for gene expression analysis. It generates interactive volcano plots, links genes to literature, pathways, and diseases, prioritizes candidates using millions of publications, identifies affected biological processes, builds network diagrams, and exports publication‐ready figures and reports for macOS and Windows ...
Carlos E. Buss   +7 more
wiley   +1 more source

On powers of circular arc graphs and proper circular arc graphs

open access: yesDiscrete Applied Mathematics, 1996
Let \(\mathcal K\) denote the class of circular arc graphs. The author gives a new proof that if a graph \(G\in {\mathcal K}\), then the power \(G^n\in {\mathcal K}\) for any positive integer \(n\). Moreover, he proves that if \(G^n\in {\mathcal K}\) then \(G^{n+2}\in {\mathcal K}\) and if \(\text{diam}(G^n)\geq 4\) then \(G^n\in {\mathcal K}\) implies
openaire   +3 more sources

Structural studies and functional engineering of NanX: an anhydro‐sialic acid transporter from Escherichia coli

open access: yesFEBS Open Bio, EarlyView.
Biophysical characterisation shows that NanX, a membrane transport protein from the major facilitator superfamily (MFS), forms both monomers and dimers after purification. AlphaFold modelling and substrate docking provide information on residues likely involved in substrate recognition for NanX and another MFS member, NanT.
Michael C. Newton‐Vesty   +13 more
wiley   +1 more source

Drawing planar graphs with circular arcs [PDF]

open access: yesDiscrete & Computational Geometry, 1999
The authors study the problem of drawing planar graphs with circular arcs, while maintaining good angular resolution and small drawing area. They show the following: (1) There is an \(n\)-vertex planar graph requiring area exponential in \(n\) for any drawing using single-circle arcs for edges and having good angular resolution. (2) Let \(d(v)\) be the
C. C. Cheng   +3 more
openaire   +3 more sources

Dysregulated Cholesterol Metabolism, Chronic Inflammation, and Disability in Severe Progressive Multiple Sclerosis

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Background Dysregulated lipid metabolism, which can affect remyelination and neural repair, has not been extensively investigated in progressive multiple sclerosis (PMS). The goal was to examine whether dysregulated cholesterol metabolism was associated with disability in PMS. Methods The study sample comprised 53 Severe PMS patients (Expanded
Taylor R. Wicks   +8 more
wiley   +1 more source

Research and Test of the Effect of Tooth Surface Friction on Dynamics Characteristic of Double Circular Arc Gear

open access: yesJixie chuandong, 2019
Because of the particularity of the design of double circular arc gears, the influence of tooth surface friction on the transmission of double circular arc gears is often neglected in the past research on the dynamic characteristics of double circular ...
Liu Xiaojie, Zhang Ruiliang, Zhang Zhiyu
doaj  

ARC 2006-21

open access: yes, 2006
Het Centraal Bodemkundig Bureau (CBB) uit Deventer heeft Archaeological Research & Consultancy (ARC bv) opdracht verleend voor het uitvoeren van een archeologisch inventariserend onderzoek (IVO) op een perceel naast Noldijk 84 in Barendrecht.
Wullink, A.J. (ARC b.v.), A.J. Wullink
core   +1 more source

Modification Problems Toward Proper (Helly) Circular-Arc Graphs [PDF]

open access: yes, 2023
We present a 9^k ⋅ n^O(1)-time algorithm for the proper circular-arc vertex deletion problem, resolving an open problem of van ’t Hof and Villanger [Algorithmica 2013] and Crespelle et al. [Computer Science Review 2023]. Our structural study also implies
Yuan, H   +5 more
core   +1 more source

Mechanochemical Synthesis and Characterization of Nanostructured ErB4 and NdB4 Rare‐Earth Tetraborides

open access: yesAdvanced Engineering Materials, Volume 27, Issue 6, March 2025.
ErB4 and NdB4 nanostructured powders are produced by mechanochemical synthesis. 5 h mechanical alloying and 4 M HCl acid leaching are used in the production. ErB4 and NdB4 powders exhibit maximum magnetization of 0.4726 emu g−1 accompanied with an antiferromagnetic‐to‐paramagnetic phase transition at about TN = 18 K and 0.132 emu g−1 with a maximum at ...
Burçak Boztemur   +5 more
wiley   +1 more source

Home - About - Disclaimer - Privacy