Results 111 to 120 of about 491,070 (354)
Aldehyde dehydrogenase 1A1 (ALDH1A1) is a cancer stem cell marker in several malignancies. We established a novel epithelial cell line from rectal adenocarcinoma with unique overexpression of this enzyme. Genetic attenuation of ALDH1A1 led to increased invasive capacity and metastatic potential, the inhibition of proliferation activity, and ultimately ...
Martina Poturnajova +25 more
wiley +1 more source
Strongly Regular Graphs with Parameters (4m4, 2m4 + m2, m4 + m2, m4 + m2) Exist for All m>1 [PDF]
Using results on Hadamard difference sets, we construct regular graphical Hadamard matrices of negative type of order 4m4 for every positive integer m. If m > 1, such a Hadamard matrix is equivalent to a strongly regular graph with parameters (4m4, 2m4 ...
Haemers, W.H., Xiang, Q.
core +1 more source
Some New Cyclotomic Strongly Regular Graphs [PDF]
Given a field \(F\) and a subset \(D\) of \(F^*\) such that \(D= -D\), one can define a graph \(\Gamma\) with vertex set \(F\) by letting \(x\sim y\) whenever \(y- x\in D\). Several authors have studied the problem of finding sets \(D\) such that the graph \(\Gamma\) is strongly regular and many examples are known.
openaire +2 more sources
Targeted modulation of IGFL2‐AS1 reveals its translational potential in cervical adenocarcinoma
Cervical adenocarcinoma patients face worse outcomes than squamous cell carcinoma counterparts despite similar treatment. The identification of IGFL2‐AS1's differential expression provides a molecular basis for distinguishing these histotypes, paving the way for personalized therapies and improved survival in vulnerable populations globally.
Ricardo Cesar Cintra +6 more
wiley +1 more source
Self-Dual and LCD Codes from Kneser Graphs K(n, 2) and Generalized Quadrangles
In this paper, we study self-dual and LCD codes constructed from Kneser graphs K(n, 2) and collinearity graphs of generalized quadrangles using the so-called pure and bordered construction. We determine conditions under which these codes are self-dual or
Dean Crnković, Ana Grbac
doaj +1 more source
A matrix representation of graphs and its spectrum as a graph invariant
We use the line digraph construction to associate an orthogonal matrix with each graph. From this orthogonal matrix, we derive two further matrices. The spectrum of each of these three matrices is considered as a graph invariant. For the first two cases,
Emms, David +3 more
core +2 more sources
More two-distance counterexamples to Borsuk's conjecture from strongly regular graphs [PDF]
Thomas Jenrich
openalex +1 more source
q-analogs of strongly regular graphs
We introduce the notion of q-analogs of strongly regular graphs and give several examples of such structures. We prove a necessary condition on the parameters, show the connection to designs over finite fields, and present a classification.
Michael Braun +4 more
openaire +3 more sources
Induction of diabetes in three different mouse strains uniformly resulted in an increase in TNAP activity and a reduction in pyrophosphate (PPi) in the circulation. Inhibition of TNAP restored plasma PPi. Diabetes‐induced calcification in the media layer of the aorta was detected only in the Abcc6−/− strain, which is predisposed to ectopic ...
Krisztina Fülöp +13 more
wiley +1 more source
A (49,16,3,6) strongly regular graph does not exist [PDF]
Graphs ...
Bussemaker, F.C. +3 more
core +1 more source

