Results 91 to 100 of about 2,975,002 (298)
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 ...
Xiang, Q., Haemers, W.H.
core
Non-existence of quasi-symmetric designs having certain pseudo-geometric block graphs
The block graph of a quasi-symmetric design is strongly regular. It is a challenging problem to decide which strongly regular graphs are block graphs of quasi-symmetric designs.
Kusum S. Rajbhar, Rajendra M. Pawale
doaj +1 more source
Strongly Regular Fusions of Tensor Products of Strongly Regular Graphs
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
Spatial biology in cancer epigenetics
Spatial epigenomics combines molecular profiling with tissue architecture to reveal how gene regulation is organized within intact tissues. In cancer, these technologies uncover the mechanisms driving tumor heterogeneity and microenvironmental interactions, opening new opportunities for biomarker discovery and precision medicine.
Eva Crespo‐García, Manel Esteller
wiley +1 more source
The uniqueness of the strongly regular graph on $77$ points [PDF]
We show the uniqueness of the strongly regular graph with parameters ¿ = 77, k = 16, ¿ = O, µ = 4 embedding it in the Higman-Sims graph as a second subconstituent, and indicate the existence of a sporadic ...
A. E. Brouwer +3 more
core +1 more source
Distance regular graphs of diameter 3 and strongly regular graphs
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
Tumour heterogeneity and clonal evolution of metastatic salivary gland cancer were evaluated in two patients with adenoid carcinoma and one patient with myoepithelial carcinoma. Radiology‐guided autopsy enabled multi‐region sampling (total samples n = 149), followed by whole‐genome sequencing and phylogenetic reconstruction (17 tumour samples, 4–7 per ...
Gerben Lassche +10 more
wiley +1 more source
Arginine methylation can be viewed as a persistence‐prone post‐translational modification regulated by a network of PRMTs. Competitive and compensatory interactions among PRMTs can redistribute methylation across substrate pools shaped by sequence, structural, spatial, and environmental layers, reinforcing RNA‐processing, chromatin, and signaling ...
So Hyun Kwon, Ji Min Lee
wiley +1 more source
Distance-Regular Graphs with Strongly Regular Subconstituents [PDF]
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
High‐risk bladder cancer is typically treated with Bacillus Calmette‐Guérin (BCG), but 30–40% of patients relapse. No FDA‐ or CE‐approved biomarkers currently predict or prognosticate BCG failure. We systematically reviewed the literature and identified 72 eligible studies, revealing several promising biomarkers associated with BCG treatment response ...
Rui Ribeiro‐Pereira +7 more
wiley +1 more source

