Results 41 to 50 of about 322,612 (279)
A note on incomplete regular tournaments with handicap two of order n≡8(mod 16) [PDF]
A \(d\)-handicap distance antimagic labeling of a graph \(G=(V,E)\) with \(n\) vertices is a bijection \(f:V\to \{1,2,\ldots ,n\}\) with the property that \(f(x_i)=i\) and the sequence of weights \(w(x_1),w(x_2),\ldots,w(x_n)\) (where \(w(x_i)=\sum_{x_i
Dalibor Froncek
doaj +1 more source
Locally Pseudo-Distance-Regular Graphs
The concept of local pseudo-distance-regularity, introduced in this paper, can be thought of as a natural generalization of distance-regularity for non-regular graphs. Intuitively speaking, such a concept is related to the regularity of graph \(\Gamma\) when it is seen from a given vertex.
Fiol, M.A., Garriga, E., Yebra, J.L.A.
openaire +2 more sources
Pharmacologic ascorbate (vitamin C) increases ROS, disrupts cellular metabolism, and induces DNA damage in CRPC cells. These effects sensitize tumors to PARP inhibition, producing synergistic growth suppression with olaparib in vitro and significantly delayed tumor progression in vivo. Pyruvate rescue confirms ROS‐dependent activity.
Nicolas Gordon +13 more
wiley +1 more source
On a version of the spectral excess theorem
Given a regular (connected) graph G=(X,E) with adjacency matrix A, d+1 distinct eigenvalues, and diameter D, we give a characterization of when its distance matrix AD is a polynomial in A, in terms of the adjacency spectrum of G and the arithmetic (or ...
Miquel Àngel Fiol, Safet Penjic
doaj +1 more source
Distance-regular antipodai covering graphs
Let G be a regular graph with diameter d. G is said to be antipodal if given any distinct vertices u, v, w of G with v and w at distance d from u, then v is distance d from w. G is called distance-regular if for vertices u, v, in G of distance i apart, v is adjacent to \(c_ i\) vertices distance i-1 from u, \(a_ i\) vertices distance i from u, and \(b_
Aldred, R.E.L, Godsil, C.D
openaire +2 more sources
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
D-bounded Distance-regular Graphs
Let \(\Gamma\) be a distance-regular graph of diameter \(D\geq 3\). The paper gives all basic facts from the literature and all necessary notions, e.g. the notion of weak-geodetically closed subgraph of \(\Gamma\), the notion of \(D\)-bounded graph, etc. Let \(P(\Gamma)\) denote the poset the elements of which are the weak-geodetically closed subgraphs
openaire +3 more sources
Parallelogram-Free Distance-Regular Graphs
This paper deals with distance-regular graphs. It is shown that a distance-regular graph with certain properties has classical parameters \((d,b,\alpha,\beta)\) with ...
Liang, Yuh-jeng, Weng, Chih-wen
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
Distance-Regular Graphs and Halved Graphs
Let G be a bipartite distance-regular graph with bipartition \(V(G)=X\cup Y\). Let \(V(G')=X\) and, for x and y in X, let x be adjacent to y in G' if and only if x is of distance two from y in G. Then G' is called a halved graph of G, and is distance-regular. This paper discusses whether G' is one of the known, large-diameter, distance-regular graphs.
openaire +2 more sources

