Results 101 to 110 of about 4,129,862 (348)

Distance-Regular Graphs and Halved Graphs

open access: yesEuropean Journal of Combinatorics, 1986
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   +3 more sources

Intrapatient tumour heterogeneity and clonal evolution in an autopsy study of metastatic salivary gland cancer

open access: yesMolecular Oncology, EarlyView.
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

On Sombor indices of generalized tensor product of graph families

open access: yesResults in Control and Optimization
Graph invariants are extensively being used in different fields for analysing the structural properties of different compounds. Several topological indices, their properties and relations between different indices have been explored. Ivan Gutman recently
Nadar Jenita Mary Masilamani Raja   +1 more
doaj   +1 more source

Generation of strongly regular graphs from quaternary complex Hadamard matrices

open access: yesCeylon Journal of Science, 2018
A strongly regular graph with parameters (v, k, μ, λ) is a regular graph G with v vertices and k degree in which every two adjacent vertices have λ common neighbors and every two non-adjacent vertices have μ common neighbors. In this paper, we propose an
W. V. Nishadi   +3 more
doaj   +1 more source

On regular-stable graphs

open access: yesElectronic Notes in Discrete Mathematics, 2001
Abstract Abstract A graph G , is λ-regular-stable if it has at least a maximum independent set I , such that for ∀ v ∈ V(G)\I , the number of vertices in NG(V) , ⨆ I , is constant, and equal to λ. Here we give some results for this class of graphs.
Barbosa, R., Cardoso, D.M.
openaire   +3 more sources

Factorizing regular graphs [PDF]

open access: yesJournal of Combinatorial Theory, Series B, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Predictive and prognostic biomarkers of Bacillus Calmette‐Guérin therapy failure in bladder cancer patients: A systematic review

open access: yesMolecular Oncology, EarlyView.
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

On clique graphs and clique regular graphs

open access: yesDiscrete Mathematics
If $Γ$ is a graph for which every edge is in exactly one clique of order $ω$, then one can form a new graph with vertex set equal to these cliques. This is a generalization of the line graph of $Γ$. We discover many general results and classifications related to these clique graph that will be useful to researchers studying these objects. In particular,
Robert R. Petro, Connor M. Phillips
openaire   +3 more sources

p190A/ARHGAP35 and p190B/ARHGAP5 proteins in endometrial cancer: a novel cancer‐relevant paralog interplay

open access: yesMolecular Oncology, EarlyView.
This study identifies ARHGAP5, in addition to the frequently mutated ARHGAP35, as significantly mutated in endometrial cancer. Mutations in both genes co‐occur and are associated with their correlated downregulation. Functional CRISPR studies show that both paralogs regulate similar pathways, including actin cytoskeleton organization.
Mathilde Pinault   +12 more
wiley   +1 more source

On Automorphisms of a Distance-Regular Graph with Intersection Array {125,96,1;1,48,125} [PDF]

open access: yesУчёные записки Казанского университета: Серия Физико-математические науки, 2017
J. Koolen posed the problem of studying distance-regular graphs in which neighborhoods of vertices are strongly regular graphs with the second eigenvalue ≤ t for the given positive integer t.
V.V. Bitkina, A.A. Makhnev
doaj  

Home - About - Disclaimer - Privacy