Results 101 to 110 of about 2,911,408 (294)

The strongly regular (45,12,3,3) graphs [PDF]

open access: yes, 2006
Using two backtrack algorithms based on dierent techniques, designed and implemented independently, we were able to determine up to isomorphism all strongly regular graphs with parameters v = 45, k = 12, λ = μ = 3.
Degraer, J.   +5 more
core   +4 more sources

Strongly Regular Fusions of Tensor Products of Strongly Regular Graphs

open access: yesRocky Mountain Journal of Mathematics, 1994
Let \(G\) and \(H\) be strongly regular graphs with (0, 1)-adjacency matrices \(A_ 0= I\), \(A_ 1\), \(A_ 2= J-I- A_ 1\) and \(B_ 0= I\), \(B_ 1,\) \(B_ 2= J- I- B_ 1\) respectively. The tensor product \(G\otimes H\) is defined to be the nine class association scheme with adjacency matrices \(A_ i\otimes B_ j\). By combining (fusing) some of these nine
openaire   +2 more sources

Regular graphs with four eigenvalues [PDF]

open access: yes
We study the connected regular graphs with four distinct eigenvalues. Properties and feasibility conditions of the eigenvalues are found. Several examples, constructions and characterizations are given, as well as some uniqueness and nonexistence results.
Dam, E.R. van
core  

SPHINX31 acts as a SRPK1 inhibitor targeting the ATR/DNA‐PKcs/CHK1 replicative checkpoint to inhibit cell growth in non‐small cell lung cancer

open access: yesMolecular Oncology, EarlyView.
The kinase SRPK1 directly interacts with the protein TOPBP1 and regulates the pre‐mRNA splicing of WIZ thereby contributing to the activation of the ATR/CHK1 replicative checkpoint in response to replicative stress. This allows cancer cells' genomic stability and survival.
Amani Shreim   +17 more
wiley   +1 more source

Distance regular graphs of diameter 3 and strongly regular graphs

open access: yesDiscrete Mathematics, 1984
In a paper by \textit{N. L. Biggs} [Ann. Discrete Math. 15, 69-80 (1982; Zbl 0506.05057)], two parameter sets for distance regular graphs that are antipodal covers of a complete graph were mentioned for which the existence of a corresponding graph was unknown.
openaire   +4 more sources

Targeting the EpCAM‐AXL axis to overcome drug resistance in lung cancer

open access: yesMolecular Oncology, EarlyView.
Lung cancer cells often evade therapy by hijacking signaling pathways. We reveal that cleaved EpCAM (sEpCAM) stabilizes the oncogenic protein AXL, driving NF‐κB and STAT3‐mediated chemoresistance. This EpCAM‐AXL axis identifies a high‐risk patient subset with poor prognosis.
Alexa Guerrero‐Alba   +5 more
wiley   +1 more source

Universal Adjacency Matrices with Two Eigenvalues [PDF]

open access: yes
AMS Mathematics Subject Classification: 05C50.Adjacency matrix;Universal adjacency matrix;Laplacian matrix;signless Laplacian;Graph spectra;Eigenvalues;Strongly regular ...
Omidi, G.R., Haemers, W.H.
core  

Characterization of therapeutic antibodies targeting lymphatic and vascular resistance factor for the treatment of hypervascularized and highly metastatic cancers

open access: yesMolecular Oncology, EarlyView.
LVRF (lymphatic and vascular resistance factor) is a VEGFA splice variant upregulated in response to anti‐angiogenic therapy that fosters tumor adaptation through enhanced vascularization, lymphangiogenesis, and metastatic dissemination. Targeting LVRF with fully human neutralizing antibodies disrupts these processes and limits resistant tumor growth ...
Marion David   +12 more
wiley   +1 more source

Distance-Regular Graphs with Strongly Regular Subconstituents [PDF]

open access: yesJournal of Algebraic Combinatorics, 1997
The main result of the article is a theorem about distance-regular graphs of diameter \(d\geq 3\) with all subconstituents being strongly regular graphs. The author shows that these are precisely the Taylor graphs \((d=3\) and \(|\Gamma_3 (u) |=1)\) or graphs with \(a_1= 0\), \(a_i\leq 1\) for \(2\leq i\leq d\).
openaire   +2 more sources

Graphs with Few Eigenvalues. An Interplay between Combinatorics and Algebra. [PDF]

open access: yes
: Two standard matrix representations of a graph are the adjacency matrix and the Laplace matrix. The eigenvalues of these matrices are interesting parameters of the graph.
Dam, E.R. van
core  

Home - About - Disclaimer - Privacy