Results 61 to 70 of about 542,793 (319)
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
Minimum Distance Distribution of Irregular Generalized LDPC Code Ensembles
In this paper, the minimum distance distribution of irregular generalized LDPC (GLDPC) code ensembles is investigated. Two classes of GLDPC code ensembles are analyzed; in one case, the Tanner graph is regular from the variable node perspective, and in ...
Flanagan, Mark F. +2 more
core +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
On 3-Chromatic Distance-Regular Graphs [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Blokhuis , A. +2 more
openaire +11 more sources
RIPK4 function interferes with melanoma cell adhesion and metastasis
RIPK4 promotes melanoma growth and spread. RIPK4 levels increase as skin lesions progress to melanoma. CRISPR/Cas9‐mediated deletion of RIPK4 causes melanoma cells to form less compact spheroids, reduces their migratory and invasive abilities and limits tumour growth and dissemination in mouse models.
Norbert Wronski +9 more
wiley +1 more source
A flocking algorithm for multi-agent systems with connectivity preservation under hybrid metric-topological interactions. [PDF]
In this paper, we propose a connectivity-preserving flocking algorithm for multi-agent systems in which the neighbor set of each agent is determined by the hybrid metric-topological distance so that the interaction topology can be represented as the ...
Chenlong He, Zuren Feng, Zhigang Ren
doaj +1 more source
Addressing graph products and distance-regular graphs
Graham and Pollak showed that the vertices of any connected graph $G$ can be assigned $t$-tuples with entries in $\{0, a, b\}$, called addresses, such that the distance in $G$ between any two vertices equals the number of positions in their addresses where one of the addresses equals $a$ and the other equals $b$.
Sebastian M. Cioabă +4 more
openaire +3 more sources
COMP–PMEPA1 axis promotes epithelial‐to‐mesenchymal transition in breast cancer cells
This study reveals that cartilage oligomeric matrix protein (COMP) promotes epithelial‐to‐mesenchymal transition (EMT) in breast cancer. We identify PMEPA1 (protein TMEPAI) as a novel COMP‐binding partner that mediates EMT via binding to the TSP domains of COMP, establishing the COMP–PMEPA1 axis as a key EMT driver in breast cancer.
Konstantinos S. Papadakos +6 more
wiley +1 more source

